Binary Search Tree (BST)

A Binary Search Tree is node based tree data structure.
Its a tree with nodes and edges connecting the nodes.
The key of each node is greater than all the keys in the respective node's left subtree
and less than the ones in its right subtree

Insertion & Search

• Insert a node into BST - Recursive 
• Insert a node into BST - Iterative 
• Search a node in BST - Recursive 
• Search nearest node in BST 
• Search a node in BST - Iterative 

Traversal

• Postorder Traversal - Recursive 
• Inorder Traversal - Recursive 
• Preorder Traversal - Recursive 
• Postorder Traversal - Iterative 
• Preorder Traversal - Iterative 
• Inorder Traversal - Iterative 

Miscellaneous

• Height of Binary Search Tree - Recursive Approach 
• Binary Search Tree: Find the Lowest Common Ancestor of a node 
• Height of Binary Search Tree - Iterative Approach 