Binary Search Tree

A binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node’s left subtree and less than the ones in its right subtree.

Visit the following resources to learn more:

• Tree | Illustrated Data Structures
• Binary Search Trees - Coursera
• Binary Search Trees - MIT
• Binary Search Tree Implementation in C++
• BST implementation - memory allocation in stack and heap
• Find Min and Max Element in Binary Search Tree
• Check if Given Tree is Binary Search Tree or Not
• Delete an Element from Binary Search Tree
• Inorder Successor in a binary search tree