• A node without children is called a
  • A special type of binary tree called a binary search tree is often useful.
  • Keeping data stored in a sorted order is a way to optimize searches on the data.
  • A binary search tree is a binary tree with the following property. At each node N, every value in the left sub tree of N is less than the value at N, and every value in the right sub tree of N is greater than the value at N.
Binary Tree Terms
It's only fair to share...Share on FacebookTweet about this on TwitterShare on LinkedInShare on Google+Email this to someonePrint this page
Tagged on:         

Leave a Reply

Your email address will not be published. Required fields are marked *