A Binary Search Tree is a special type of tree in which each node can have maximum two child nodes with the restriction that the value of each node in the left subtree must be less than the value of the root node and the value of each node in the right subtree must be more than the value of the root node.
'Nodes in a Binary Search Tree can be traversed in 3 ways: inorder - left-root-right, preorder - root-left-right, postorder - left-right-root.'
[
add
]
[
|
|
...
]