Definition of Binary Search Tree:
1.Every node in the left subtree must be less than the current node
2.Every node in the right subtree must be greater than the current node
Here the tree in Figure 2 is a binary search tree.
Finding a data in a Binary Search Tree
Look at the simple queue below
When we search a number in the queue, we need average (1 + 2 + 3 + 4 + 5