Why BST Over Plain Binary Tree in DSA Go - Quick Recap

Recall & Review

beginner

What is a Binary Search Tree (BST)?

A BST is a binary tree where each node's left child has a smaller value and the right child has a larger value than the node itself.

beginner

Why is searching faster in a BST compared to a plain binary tree?

Because BST keeps values ordered, it allows skipping half of the tree at each step, making search faster than checking every node.

beginner

What is the main disadvantage of a plain binary tree for searching?

A plain binary tree has no order, so searching may require checking every node, leading to slower performance.

intermediate

How does BST improve insertion compared to a plain binary tree?

BST inserts nodes in a way that keeps the tree ordered, so future searches remain efficient, unlike plain binary trees where insertion order can cause disorder.

beginner

What real-life example helps understand why BST is better than a plain binary tree?

Like a phone book sorted by names (BST), you can quickly find a contact. A random pile of papers (plain binary tree) makes finding a contact slow.

What property does a BST maintain that a plain binary tree does not?

A Nodes are arranged randomly

B Nodes have exactly two children

C All nodes have the same value

D Nodes are ordered so left < parent < right

BST keeps nodes ordered so left child is smaller and right child is larger than the parent.

Why is searching in a plain binary tree usually slower than in a BST?

A Because it has no order, so all nodes might be checked

B Because it has more nodes

C Because it uses more memory

D Because it is balanced

Without order, searching may require checking every node, making it slower.

Which operation benefits most from BST's ordering?

A Searching for a value

B Printing all nodes

C Counting nodes

D Deleting the root

Searching is faster because BST ordering allows skipping parts of the tree.

What happens if you insert nodes in random order in a plain binary tree?

A The tree stays perfectly balanced

B The tree may become unbalanced and unordered

C The tree automatically sorts nodes

D The tree becomes a BST

Random insertion can cause disorder and imbalance in a plain binary tree.

Which analogy best explains the advantage of BST over a plain binary tree?

A A fast car vs a slow bike

B A messy desk vs a clean desk

C A sorted phone book vs a random pile of papers

D A tall building vs a short building

A sorted phone book (BST) allows quick search, unlike a random pile of papers (plain binary tree).

Explain why a Binary Search Tree is preferred over a plain binary tree for searching operations.

Think about how order helps find things faster.

Describe how insertion differs between a BST and a plain binary tree and why it matters.

Consider how insertion affects the tree's shape and search.