🌿Binary Search Tree

Follow Me

🌳 Binary Search Tree (BST)

🔹 Definition:

A Binary Search Tree is a type of binary tree in which each node has:

• At most two children: left and right

• Left child contains nodes less than the parent

• Right child contains nodes greater than the parent

🔧 Rules of BST:

1. Left subtree has values less than the node

2. Right subtree has values greater than the node

3. No duplicate nodes allowed

🧠 Basic Operations:

Operation	Purpose
Insertion()	Add a new value    👈 Click Here
Searching()	Find a value    👈 Click Here
Deletion()	Remove a value    👈 Click Here
InOrder()	Traverse in sorted order    👈 Click Here
PreOrder()	Traverse node → left → right    👈 Click Here
PostOrder()	Traverse left → right → node    👈 Click Here

✅ Advantages:

• Faster searching than regular binary tree (O(log n) for balanced trees)

• In-order traversal gives sorted data

❌ Disadvantages:

• If unbalanced, time complexity can degrade to O(n)

• Need rebalancing (e.g., using AVL or Red-Black Trees)

📊 Use Cases:

• Search engines

• Databases (indexing)

• File systems