Binary Search Tree (BST)
An Efficient Way to Sort and Store Data.
Properties of a BST
- Each node has at most two children: left and right childs.
- The left subtree contains only nodes with values less than the parent node.
- The right subtree contains only nodes with values greater than the parent node.
BST Operations
- Insertion: Inserts data into the respective tree
- Deletion: Deletes a data node from a respective tree
- Search: Finds a specific data node in the tree
Visual Representation
