Binary Search Tree arose as a natural solution to the need for incorporating efficient insertion and deletion capabilities of linked lists with the support provided for fast sorting and binary search of sorted elements available in arrays and array lists. Expansion from a linear structure to a two-dimensional structure makes a solution of this kind possible. Likewise, any problem becomes easier to solve if one can transcend the boundaries of the problem.

BST combines the advantages of two other structures: an ordered array and a linked list. You can search a tree quickly, as you can an ordered array, and you can also insert and delete items quickly, as you can with linked list.

Binary tree is a hierarchical structure. It is either empty or consists of an element, called the root, and two distinct binary trees, called the left subtree and right subtree.

Simple Binary Search Tree

What is Binary Search Tree?
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 *