Binary search tree

Properties

1. Left subtree of a node N contains nodes whose values are lesser than or equal to node N’s value.
2. Right subtree of a node N contains nodes whose values are greater than node N’s value.
3. Both left and right subtrees are also BSTs.