Why BST Over Plain Binary Tree in DSA Typescript - Performance Analysis

Time Complexity: Why BST Over Plain Binary Tree

O(n) for plain tree, O(log n) for balanced BST

Understanding Time Complexity

We want to understand why using a Binary Search Tree (BST) is faster than a plain binary tree for searching data.

How does the structure affect the time it takes to find a value?

Scenario Under Consideration

Analyze the time complexity of searching a value in these two tree types.

// Plain binary tree search (no order)
function searchPlainTree(node: TreeNode | null, target: number): boolean {
  if (!node) return false;
  if (node.value === target) return true;
  return searchPlainTree(node.left, target) || searchPlainTree(node.right, target);
}

// BST search (ordered)
function searchBST(node: TreeNode | null, target: number): boolean {
  if (!node) return false;
  if (node.value === target) return true;
  if (target < node.value) return searchBST(node.left, target);
  else return searchBST(node.right, target);
}
    

The first searches all nodes without order; the second uses order to skip parts.

Identify Repeating Operations

Look at what repeats when searching.

• Primary operation: Checking nodes one by one.
• How many times: Plain tree may check every node; BST checks nodes along one path.

How Execution Grows With Input

As the tree grows, how many nodes do we check?

Input Size (n)	Approx. Operations Plain Tree	Approx. Operations BST
10	Up to 10 checks	About 4 checks (height ~ log2 10)
100	Up to 100 checks	About 7 checks (height ~ log2 100)
1000	Up to 1000 checks	About 10 checks (height ~ log2 1000)

Pattern observation: Plain tree search grows linearly with nodes; BST search grows slowly with tree height.

Final Time Complexity

Time Complexity: O(n) for plain tree, O(log n) for balanced BST

BST lets us find values much faster by skipping large parts of the tree.

Common Mistake

[X] Wrong: "BST search always checks half the nodes like binary search on arrays."

[OK] Correct: BST speed depends on tree shape; if unbalanced, it can be as slow as plain tree.

Interview Connect

Knowing why BSTs are faster helps you explain data structure choices clearly and shows you understand how structure affects speed.

Self-Check

What if the BST becomes unbalanced and looks like a linked list? How would the time complexity change?

Practice

1. Why is a Binary Search Tree (BST) preferred over a plain Binary Tree for searching operations?

easy

A. Because BST keeps elements in sorted order allowing faster search

B. Because BST uses less memory than a plain Binary Tree

C. Because BST nodes can have more than two children

D. Because BST does not require pointers to child nodes

Solution

1. Step 1: Understand the structure of BST vs plain Binary Tree

   A BST stores nodes so that left child is smaller and right child is larger, keeping data sorted. A plain Binary Tree has no order.

2. Step 2: Analyze search efficiency

   Because BST is sorted, searching can skip half the tree at each step, making it faster than searching a plain Binary Tree which may require checking all nodes.

3. Final Answer:

   Because BST keeps elements in sorted order allowing faster search -> Option A

4. Quick Check:

   Sorted structure = faster search [OK]

Hint: BST is sorted, plain tree is not, so search is faster [OK]

Common Mistakes:

• Thinking BST uses less memory
• Confusing number of children in BST
• Assuming BST has no pointers

2. Which of the following is the correct TypeScript syntax to declare a node in a Binary Search Tree?

easy

A. class Node { value: number; left: Node | null; right: Node | null; }

B. function Node(value) { this.value = value; this.left = null; this.right = null; }

C. interface Node { value: string; left: Node; right: Node; }

D. type Node = { value: number; left?: Node; right?: Node }

Solution

1. Step 1: Identify correct TypeScript class syntax for BST node

   class Node { value: number; left: Node | null; right: Node | null; } correctly declares a class with value and nullable left and right nodes using TypeScript types.

2. Step 2: Check other options for correctness

   function Node(value) { this.value = value; this.left = null; this.right = null; } is JavaScript function style, not TypeScript class. interface Node { value: string; left: Node; right: Node; } uses string value and non-nullable children which is incorrect. type Node = { value: number; left?: Node; right?: Node } uses optional children but is a type alias, not a class.

3. Final Answer:

   class Node { value: number; left: Node | null; right: Node | null; } -> Option A

4. Quick Check:

   TypeScript class with nullable children = class Node { value: number; left: Node | null; right: Node | null; } [OK]

Hint: Look for TypeScript class with nullable left/right nodes [OK]

Common Mistakes:

• Confusing JavaScript function with TypeScript class
• Using non-nullable children causing errors
• Using wrong value types

3. Given the following BST insertion code snippet, what will be the in-order traversal output after inserting values 10, 5, 15, 3, 7?

medium

A. [5, 3, 7, 10, 15]

B. [10, 5, 15, 3, 7]

C. [15, 10, 7, 5, 3]

D. [3, 5, 7, 10, 15]

Solution

1. Step 1: Insert values into BST in given order

   Insert 10 as root, 5 to left, 15 to right, 3 to left of 5, 7 to right of 5.

2. Step 2: Perform in-order traversal (left, root, right)

   Traverse left subtree: 3, 5, 7; then root 10; then right subtree 15. Combined: [3, 5, 7, 10, 15]

3. Final Answer:

   [3, 5, 7, 10, 15] -> Option D

4. Quick Check:

   In-order traversal of BST = sorted values [OK]

Hint: In-order traversal of BST always gives sorted list [OK]

Common Mistakes:

• Confusing traversal order
• Inserting nodes incorrectly
• Mixing up left and right children

4. Identify the bug in this BST insertion function snippet in TypeScript:

function insert(root: Node | null, val: number): Node {
  if (!root) return new Node(val);
  if (val < root.value) insert(root.left, val);
  else insert(root.right, val);
  return root;
}

medium

A. Node constructor is called without new keyword

B. Missing return statements for recursive calls

C. Incorrect comparison operator for BST insertion

D. Function does not handle duplicate values

Solution

1. Step 1: Analyze recursive calls in insertion

   The recursive calls insert(root.left, val) and insert(root.right, val) do not assign the returned node back to root.left or root.right.

2. Step 2: Identify missing return assignments

   Without assigning, the tree structure does not update. Correct code should be root.left = insert(root.left, val) and root.right = insert(root.right, val).

3. Final Answer:

   Missing return statements for recursive calls -> Option B

4. Quick Check:

   Recursive insert must update child links [OK]

Hint: Always assign recursive insert results to child nodes [OK]

Common Mistakes:

• Not assigning recursive call results
• Using wrong comparison operators
• Ignoring duplicates silently

5. You have a plain Binary Tree and a BST both containing the same values. Which operation benefits the most from using the BST instead of the plain Binary Tree, and why?

hard

A. Traversing all nodes, because BST traversal is faster than plain tree traversal

B. Inserting a new value, because BST insertion is always O(1)

C. Searching for a value, because BST allows O(log n) average time search

D. Deleting a node, because BST deletion never requires rebalancing

Solution

1. Step 1: Compare searching in BST vs plain Binary Tree

   BST keeps nodes sorted, enabling binary search-like behavior with average O(log n) time. Plain Binary Tree has no order, so search is O(n).

2. Step 2: Evaluate other operations

   Insertion in BST is not always O(1), deletion may require rebalancing, and traversal visits all nodes in both trees equally.

3. Final Answer:

   Searching for a value, because BST allows O(log n) average time search -> Option C

4. Quick Check:

   BST speeds up search, not insertion or traversal [OK]

Hint: BST speeds up search, not insertion or traversal [OK]

Common Mistakes:

• Thinking insertion is always O(1)
• Assuming deletion never needs rebalancing
• Believing traversal is faster in BST