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

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

Traversal

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

Miscellaneous

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