Why BST Over Plain Binary Tree in DSA Javascript - The Real Reason

The Big Idea

What if you could find any book in a huge messy pile in just a few steps?

The Scenario

Imagine you have a big box of unsorted books and you want to find a specific one quickly.

You start flipping through each book one by one, hoping to find the right title.

The Problem

Searching this way is slow and tiring because you have no order to follow.

You waste time checking books that are not what you want.

The Solution

A Binary Search Tree (BST) organizes books so that smaller titles go to the left and bigger titles go to the right.

This order helps you skip many books and find the one you want much faster.

Before vs After

✗ Before

function findBook(books, title) {
  for (let i = 0; i < books.length; i++) {
    if (books[i] === title) return i;
  }
  return -1;
}

✓ After

function findBookInBST(node, title) {
  if (!node) return null;
  if (node.value === title) return node;
  if (title < node.value) return findBookInBST(node.left, title);
  else return findBookInBST(node.right, title);
}

What It Enables

BSTs let you find, add, or remove items quickly by following a clear order.

Real Life Example

Phone contacts are often stored in a BST-like structure so you can quickly find a name without scrolling through the entire list.

Key Takeaways

Plain binary trees have no order, making search slow.

BSTs keep data sorted to speed up search and updates.

Using BSTs saves time and effort in many applications.

Practice

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

easy

A. BST does not require pointers to child nodes.

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

C. BST nodes can have more than two children.

D. BST allows faster search by maintaining sorted order of elements.

Solution

1. Step 1: Understand the structure difference

   A BST keeps elements in sorted order where left child is smaller and right child is larger, unlike a plain Binary Tree which has no order.

2. Step 2: Analyze search efficiency

   Because of this order, BST allows searching by comparing and moving left or right, reducing search time to O(log n) on average, while plain Binary Tree search is O(n).

3. Final Answer:

   BST allows faster search by maintaining sorted order of elements. -> Option D

4. Quick Check:

   BST sorted order = faster search [OK]

Hint: BST keeps order for quick search decisions [OK]

Common Mistakes:

• Thinking BST uses less memory than plain Binary Tree
• Confusing number of children in BST
• Assuming BST nodes don't have child pointers

2. Which of the following is the correct way to check if a node's value is less than the root's value in JavaScript BST code?

easy

A. if (node.value < root.value) {}

B. if node.value < root.value {}

C. if (node.value << root.value) {}

D. if node.value < root.value then {}

Solution

1. Step 1: Identify correct JavaScript syntax for if statement

   JavaScript requires parentheses around the condition and curly braces for the block.

2. Step 2: Check comparison operator and syntax

   The less than operator is <, and it must be inside parentheses: if (condition) {} is correct.

3. Final Answer:

   if (node.value < root.value) {} -> Option A

4. Quick Check:

   Correct if syntax = if (node.value < root.value) {} [OK]

Hint: Use parentheses and curly braces in if statements [OK]

Common Mistakes:

• Omitting parentheses around condition
• Using incorrect operators like <<
• Writing if without parentheses or braces

3. What will be the output of the following code snippet that inserts values into a BST and then performs an in-order traversal?

class Node {
  constructor(value) {
    this.value = value;
    this.left = null;
    this.right = null;
  }
}

class BST {
  constructor() {
    this.root = null;
  }
  insert(value) {
    const newNode = new Node(value);
    if (!this.root) {
      this.root = newNode;
      return;
    }
    let current = this.root;
    while (true) {
      if (value < current.value) {
        if (!current.left) {
          current.left = newNode;
          break;
        }
        current = current.left;
      } else {
        if (!current.right) {
          current.right = newNode;
          break;
        }
        current = current.right;
      }
    }
  }
  inOrder(node, result = []) {
    if (node) {
      this.inOrder(node.left, result);
      result.push(node.value);
      this.inOrder(node.right, result);
    }
    return result;
  }
}

const tree = new BST();
tree.insert(10);
tree.insert(5);
tree.insert(15);
tree.insert(7);
console.log(tree.inOrder(tree.root));

medium

A. [5, 7, 10, 15]

B. [10, 5, 7, 15]

C. [15, 10, 7, 5]

D. [7, 5, 10, 15]

Solution

1. Step 1: Insert nodes into BST

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

2. Step 2: Perform in-order traversal

   In-order visits left subtree, root, then right subtree. So order is 5, 7, 10, 15.

3. Final Answer:

   [5, 7, 10, 15] -> Option A

4. Quick Check:

   In-order BST traversal = sorted values [OK]

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

Common Mistakes:

• Confusing traversal order
• Inserting nodes incorrectly
• Expecting pre-order or post-order output

4. The following code attempts to insert a value into a BST but causes an infinite loop. What is the error?

insert(value) {
  const newNode = new Node(value);
  if (!this.root) {
    this.root = newNode;
    return;
  }
  let current = this.root;
  while (true) {
    if (value < current.value) {
      if (!current.left) {
        current.left = newNode;
        break;
      } else {
        current = current.left;
      }
    } else {
      if (!current.right) {
        current.right = newNode;
        break;
      } else {
        current = current.right;
      }
    }
  }
}

medium

A. New node is not created properly.

B. Incorrect comparison operator used.

C. Missing break statement after inserting new node.

D. Root node is not initialized.

Solution

1. Step 1: Analyze loop behavior after insertion

   After assigning newNode to left or right child, loop continues without break, causing infinite loop.

2. Step 2: Identify missing break

   Adding break after insertion stops the loop and prevents infinite iteration.

3. Final Answer:

   Missing break statement after inserting new node. -> Option C

4. Quick Check:

   Break after insert stops infinite loop [OK]

Hint: Add break after insertion to exit loop [OK]

Common Mistakes:

• Forgetting break after insertion
• Changing comparison operators unnecessarily
• Assuming new node creation is faulty

5. You want to store a large set of numbers and perform frequent searches. Why would using a balanced BST be better than a plain Binary Tree or an unbalanced BST?

hard

A. Balanced BST uses less memory than unbalanced BST.

B. Balanced BST guarantees O(log n) search time, unlike unbalanced BST or plain Binary Tree.

C. Balanced BST allows nodes to have multiple parents for faster access.

D. Balanced BST does not require pointers to child nodes.

Solution

1. Step 1: Understand search time in different trees

   Plain Binary Tree search is O(n), unbalanced BST can degrade to O(n) if skewed, balanced BST keeps height low.

2. Step 2: Benefit of balanced BST

   Balanced BST maintains height around log n, ensuring search, insert, delete operations are O(log n) consistently.

3. Final Answer:

   Balanced BST guarantees O(log n) search time, unlike unbalanced BST or plain Binary Tree. -> Option B

4. Quick Check:

   Balanced BST = consistent fast search [OK]

Hint: Balance keeps tree height low for fast search [OK]

Common Mistakes:

• Thinking balanced BST uses less memory
• Believing nodes can have multiple parents
• Assuming no child pointers needed