Binary Search Tree (Day 5)

Binary Seacrh Tree.

Is supports faster searching rapid sorting and easy insertion and deletion.

How Binary Tree Concept Work:

1.     Begin at Root

2.     If the root contains X then search terminates successfully

3.     If X is less than root’s key search recursively on the left sub tree, otherwise search recursively on right sub tree.