- Binary Search Tree (BST) is a collection of nodes where each node has a key and an associated value. The tree maintains an order property which means that node are arranged in such a way that value less than root value exist in left sub-tree and values more than root-value exist in right sub-tree. Every sub-tree follows this property. Following tree represents BST.
Lets develop good understanding of the basic of BST. [Click the following links to watch the video]
- Binary Search Tree – Fundamentals
- How to Perform Search & Insert Operation in Binary Search Tree (BST)
- How to Delete Node in Binary Search Tree
You are invited to raise queries by writing your question in the box given below
Expertvision 