w3college.com

BINARY SEARCH TREE    1.      A Binary Search Tree (BST) is a tree in which all the nodes follow the below-mentioned properties  ·         The value of the key of the left sub-tree is less than the value of its parent (root) node's key. ·         The value of the key of the right sub-tree is greater than or equal to the value of its parent (root) nodes key. ·         All key's of a binary search tree must be distinct. ·         All key's in the left sub-tree 'T' are less than the root element (node). ·         All key's in the right sub-tree 'T' are greater than the root element (node).   2. Thus, BST divides all its sub-trees into two segments; the left sub-tree and the right sub-tree and can be defined as  left subtree (keys) < node (key) ≤ ri...