A binary tree is a tree in which no node can have more than two children. The property that makes a binary tree into a binary search tree is that for every node, X, in the tree, the values of all the keys in its left subtree are smaller than the key value in X, and the values of all the keys in its right subtree are larger than the key value in X.

An important application of binary trees is their use in searching.

Here are the operations which are possible on binary search tree ADT (abstract data type),

1)Make Empty

2)Find

3)FindMin

4)FindMax

5)Insert

6)Delete

Please referĀ http://www.refcode.net/2013/02/binary-search-trees.html

Advertisements