HOW TO INSERT, DELETE AND TRAVERSE A BINARY SEARCH TREE – EXPLANATION WITH EXAMPLE
2
Binary search tree is a binary tree with following properties: Left sub tree of a node always contains lesser key Right subtree of a node always contains greater
