A Binary search tree (BST) is type of tree.They are contains left subtree and right subtree. leaf subtree element contain less then root of BST and right subtree element contain value are grater then and equal to root.

Example

Root Node

First inserted element of BST is root of tree. Root node is starting point of Binary search tree.

Example

424 is root of BST. Root is top element of tree.

Edge

Connected BST nodes it is called Edge. Number of Node-1 Edge are possible in Binary search tree.

Longest distance between leaf node to any particular node that is called height of this particular node. And height of BST tree is Root node to longest leaf node.