Binary search tree is type of binary tree. binary search tree are follow following properties.

1) root are the starting point of tree. inserted value is less then root node value then it will put on left side of root node. that is called left subtree.

2) If inserted value is greater than or equal to root node then it will put on right side of root node. That is called right subtree.

Root Node

Root is starting point of bst. Help of root node is visited or access all other bst node..

Example of Root node

Example of Root node

Leaf Node

leaf node are no left and right child. blue circle indicate leaf node of tree.

View comments and participate Discussion