Why BST Over Plain Binary Tree in DSA C - Why This Pattern

Mental Model

A Binary Search Tree (BST) keeps data sorted to find items faster than a plain binary tree.

Analogy: Think of a phone book: names are in order so you can quickly find a number, unlike a random pile of papers.

Plain Binary Tree:
    5
   / \
  3   8
 /   / \
1   6   9

BST:
    5
   / \
  3   8
 /   / \
1   6   9

Dry Run Walkthrough

Input: Plain binary tree with nodes 5,3,8,1,6,9; search for 6

Goal: Show how searching for 6 is slower in plain binary tree vs faster in BST

Step 1: Start search at root node 5 in plain binary tree

5 [searching] -> 3 -> 8 -> 1 -> 6 -> 9

Why: We begin at the root to find the target value

Step 2: Check left child 3, not 6, then right child 8

5 -> 3 [searching] -> 8 -> 1 -> 6 -> 9

Why: No order to guide search, must check multiple branches

Step 3: Check left child 1, no match; back to 8 then check 6

5 -> 3 -> 1 [searching], then 8 -> 6 [searching] -> 9

Why: Must explore many nodes due to no sorting

Step 4: Find 6 at leaf node after multiple checks

5 -> 3 -> 1 -> 8 -> 6 [found] -> 9

Why: Search took many steps because tree is unordered

Step 5: Start search at root node 5 in BST

5 [searching] -> 3 -> 8 -> 1 -> 6 -> 9

Why: Begin at root in BST which is sorted

Step 6: Since 6 > 5, go right to 8

5 -> 8 [searching] -> 3 -> 1 -> 6 -> 9

Why: BST property guides search direction

Step 7: Since 6 < 8, go left to 6

5 -> 8 -> 6 [found] -> 3 -> 1 -> 9

Why: BST allows skipping unnecessary nodes

Result:

Plain Binary Tree search path: 5 -> 3 -> 1 -> 8 -> 6 [found]
BST search path: 5 -> 8 -> 6 [found]
BST search is faster due to sorted structure

Annotated Code

DSA C

#include <stdio.h>
#include <stdlib.h>

// Node structure for binary tree
typedef struct Node {
    int data;
    struct Node* left;
    struct Node* right;
} Node;

// Create new node
Node* newNode(int data) {
    Node* node = (Node*)malloc(sizeof(Node));
    node->data = data;
    node->left = NULL;
    node->right = NULL;
    return node;
}

// Search in plain binary tree (no order)
int searchPlain(Node* root, int target) {
    if (root == NULL) return 0;
    if (root->data == target) return 1;
    // search left subtree
    if (searchPlain(root->left, target)) return 1;
    // search right subtree
    return searchPlain(root->right, target);
}

// Search in BST
int searchBST(Node* root, int target) {
    if (root == NULL) return 0;
    if (root->data == target) return 1;
    if (target < root->data) {
        return searchBST(root->left, target); // go left if smaller
    } else {
        return searchBST(root->right, target); // go right if larger or equal
    }
}

int main() {
    // Build plain binary tree
    Node* rootPlain = newNode(5);
    rootPlain->left = newNode(3);
    rootPlain->right = newNode(8);
    rootPlain->left->left = newNode(1);
    rootPlain->right->left = newNode(6);
    rootPlain->right->right = newNode(9);

    // Build BST with same values
    Node* rootBST = newNode(5);
    rootBST->left = newNode(3);
    rootBST->right = newNode(8);
    rootBST->left->left = newNode(1);
    rootBST->right->left = newNode(6);
    rootBST->right->right = newNode(9);

    int target = 6;

    printf("Search %d in plain binary tree: %s\n", target, searchPlain(rootPlain, target) ? "Found" : "Not Found");
    printf("Search %d in BST: %s\n", target, searchBST(rootBST, target) ? "Found" : "Not Found");

    return 0;
}

if (root == NULL) return 0;

stop search if reached empty node

if (root->data == target) return 1;

found target, stop search

if (searchPlain(root->left, target)) return 1;

search left subtree in plain tree

return searchPlain(root->right, target);

search right subtree if not found left

if (target < root->data) { return searchBST(root->left, target); } else { return searchBST(root->right, target); }

use BST property to decide direction

Output

Search 6 in plain binary tree: Found

Search 6 in BST: Found

Complexity Analysis

Time: O(n) for plain binary tree because it may check every node; O(h) for BST where h is tree height because it skips half the nodes each step

Space: O(h) for recursion stack in both, where h is tree height

vs Alternative: BST is faster than plain binary tree for search because it uses ordering to skip branches, reducing time from linear to logarithmic in balanced cases

Edge Cases

Empty tree

Search returns not found immediately

DSA C

if (root == NULL) return 0;

Target not in tree

Search explores nodes until all checked, then returns not found

DSA C

if (root == NULL) return 0;

Single node tree with target

Search finds target at root immediately

DSA C

if (root->data == target) return 1;

When to Use This Pattern

When you need fast search in a tree, look for BST pattern because it keeps data sorted to reduce search steps.

Common Mistakes

Mistake: Trying to search BST like a plain tree without using ordering
Fix: Use the BST property to decide left or right subtree to search

Mistake: Assuming plain binary tree search is fast
Fix: Understand plain tree search is linear and can be slow

Summary

Shows why BST is better than plain binary tree for searching data.

Use BST when you want faster search by keeping data sorted.

The key is BST's order lets you skip half the tree each step.

Practice

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

easy

A. Because BST does not require pointers to child nodes

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

C. Because BST nodes can have more than two children

D. Because BST keeps elements in a sorted order allowing faster search

Solution

1. Step 1: Understand the structure of BST

   A BST stores elements so that left child nodes are smaller and right child nodes are larger than the parent node, maintaining sorted order.

2. Step 2: Compare search efficiency

   This sorted structure allows searching by comparing values and moving left or right, reducing search time to O(log n) on average, unlike a plain Binary Tree which has no order and requires O(n) time.

3. Final Answer:

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

4. Quick Check:

   BST sorted order = faster search [OK]

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

Common Mistakes:

• Thinking BST uses less memory than plain 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 declare a node structure for a BST in C?

easy

A. typedef struct Node { int data; struct Node* left; struct Node* right; } Node;

B. typedef struct Node { int data; struct Node left; struct Node right; } Node;

C. typedef struct Node { int data; Node* left; Node* right; } Node;

D. typedef struct Node { int data; int* left; int* right; } Node;

Solution

1. Step 1: Understand C struct pointer usage

   In C, to refer to the same struct type inside itself, pointers must be used with 'struct Node*'.

2. Step 2: Check each option

   typedef struct Node { int data; struct Node* left; struct Node* right; } Node; correctly uses 'struct Node*' for left and right pointers. typedef struct Node { int data; struct Node left; struct Node right; } Node; incorrectly uses struct Node (not pointer), causing infinite size. typedef struct Node { int data; Node* left; Node* right; } Node; uses 'Node*' without 'struct' keyword which is invalid in C without typedef. typedef struct Node { int data; int* left; int* right; } Node; uses int pointers which is incorrect for child nodes.

3. Final Answer:

   typedef struct Node { int data; struct Node* left; struct Node* right; } Node; -> Option A

4. Quick Check:

   Use 'struct Node*' for child pointers in C [OK]

Hint: Use 'struct Node*' for child pointers in C structs [OK]

Common Mistakes:

• Using struct Node instead of pointer causing infinite size
• Omitting 'struct' keyword in C
• Using int* instead of struct pointers

3. What will be the output of the following C code that inserts values into a BST and then performs an inorder traversal?

typedef struct Node {
    int data;
    struct Node* left;
    struct Node* right;
} Node;

Node* insert(Node* root, int val) {
    if (root == NULL) {
        Node* newNode = (Node*)malloc(sizeof(Node));
        newNode->data = val;
        newNode->left = newNode->right = NULL;
        return newNode;
    }
    if (val < root->data) root->left = insert(root->left, val);
    else root->right = insert(root->right, val);
    return root;
}

void inorder(Node* root) {
    if (root == NULL) return;
    inorder(root->left);
    printf("%d ", root->data);
    inorder(root->right);
}

int main() {
    Node* root = NULL;
    root = insert(root, 10);
    root = insert(root, 5);
    root = insert(root, 15);
    inorder(root);
    return 0;
}

medium

A. 5 10 15

B. 10 5 15

C. 15 10 5

D. 10 15 5

Solution

1. Step 1: Trace insertions into BST

   Insert 10 as root. Insert 5 goes to left of 10. Insert 15 goes to right of 10.

2. Step 2: Perform inorder traversal

   Inorder visits left subtree, root, then right subtree. So it prints 5, then 10, then 15.

3. Final Answer:

   5 10 15 -> Option A

4. Quick Check:

   Inorder traversal of BST = sorted order [OK]

Hint: Inorder traversal of BST prints sorted values [OK]

Common Mistakes:

• Confusing preorder or postorder with inorder
• Not inserting nodes correctly
• Printing nodes in wrong order

4. The following code is intended to insert a value into a BST but causes a segmentation fault. What is the error?

Node* insert(Node* root, int val) {
    if (root == NULL) {
        Node newNode;
        newNode.data = val;
        newNode.left = NULL;
        newNode.right = NULL;
        return &newNode;
    }
    if (val < root->data) root->left = insert(root->left, val);
    else root->right = insert(root->right, val);
    return root;
}

medium

A. Not checking if root is NULL before accessing root->data

B. Using 'newNode' instead of 'newNode*' for pointer

C. Returning address of local variable 'newNode' which goes out of scope

D. Missing malloc to allocate memory for new node

Solution

1. Step 1: Analyze node creation in insert function

   The code creates 'Node newNode;' as a local variable on stack inside the function.

2. Step 2: Understand scope and pointer return

   Returning '&newNode' returns address of local variable which is destroyed after function returns, causing invalid memory access and segmentation fault.

3. Final Answer:

   Returning address of local variable 'newNode' which goes out of scope -> Option C

4. Quick Check:

   Local variable address returned = invalid pointer [OK]

Hint: Never return address of local variable; use malloc [OK]

Common Mistakes:

• Ignoring local variable lifetime
• Not using malloc for dynamic allocation
• Confusing pointer and value types

5. You have a plain Binary Tree and a BST both containing the same 7 unique integer values. Which of the following statements about searching for a value is TRUE?

hard

A. Searching in BST is always faster because it is balanced

B. Searching in BST can be faster on average due to ordered structure, but worst-case can be as slow as plain Binary Tree

C. Searching in plain Binary Tree is faster because it has no order constraints

D. Searching speed is the same for both because they have same number of nodes

Solution

1. Step 1: Understand BST search complexity

   BST search is O(log n) on average if balanced, but can degrade to O(n) if skewed.

2. Step 2: Compare with plain Binary Tree search

   Plain Binary Tree has no order, so search is always O(n) as it may need to check all nodes.

3. Step 3: Analyze given statements

   Searching in BST is always faster because it is balanced is false because BST is not always balanced. Searching in BST can be faster on average due to ordered structure, but worst-case can be as slow as plain Binary Tree correctly states average case advantage and worst case equality. Searching in plain Binary Tree is faster because it has no order constraints is false; plain tree is slower. Searching speed is the same for both because they have same number of nodes is false; structure affects search speed.

4. Final Answer:

   Searching in BST can be faster on average due to ordered structure, but worst-case can be as slow as plain Binary Tree -> Option B

5. Quick Check:

   BST average faster, worst-case equal [OK]

Hint: BST average faster, worst-case can be slow [OK]

Common Mistakes:

• Assuming BST is always balanced
• Thinking plain tree search is faster
• Ignoring worst-case BST behavior