Why BST Over Plain Binary Tree in DSA C - Why It Works

Concept Flow - Why BST Over Plain Binary Tree

Start with Plain Binary Tree

↓

Insert nodes anywhere

↓

No order maintained

↓

Search: Need to check all nodes

↓

Time: O(n) worst case

↓

Switch to BST

↓

Insert nodes with order: left < root < right

↓

Search: Compare and go left or right

↓

Time: O(log n) average

↓

Efficient search, insert, delete

Shows the flow from unordered plain binary tree insertion and search to ordered BST insertion and efficient search.

Execution Sample

DSA C

/* Insert nodes in Plain Binary Tree */
Insert(root, 10);
Insert(root, 5);
Insert(root, 15);
Search(root, 15);

/* Insert nodes in BST */
InsertBST(root, 10);
InsertBST(root, 5);
InsertBST(root, 15);
SearchBST(root, 15);

Inserts nodes in plain binary tree and BST, then searches for 15 in both.

Execution Table

Step	Operation	Nodes in Tree	Pointer Changes	Visual State
1	Insert 10 in Plain Binary Tree	10	root -> 10	10
2	Insert 5 in Plain Binary Tree	10, 5	root->left -> 5	10 / 5
3	Insert 15 in Plain Binary Tree	10, 5, 15	root->right -> 15	10 / \ 5 15
4	Search 15 in Plain Binary Tree	10, 5, 15	Traverse all nodes	Search checks 10 -> 5 -> 15 (found)
5	Insert 10 in BST	10	root -> 10	10
6	Insert 5 in BST	10, 5	root->left -> 5	10 / 5
7	Insert 15 in BST	10, 5, 15	root->right -> 15	10 / \ 5 15
8	Search 15 in BST	10, 5, 15	Compare 15 > 10, go right	Search path: 10 -> 15 (found)
9	Search 5 in BST	10, 5, 15	Compare 5 < 10, go left	Search path: 10 -> 5 (found)
10	Search 20 in BST	10, 5, 15	Compare 20 > 10, go right; 20 > 15, go right (null)	Not found

💡 Search ends when node found or null reached

Variable Tracker

Variable	Start	After 1	After 2	After 3	After 4	After 5	After 6	After 7	After 8	After 9	Final
root (Plain Binary Tree)	null	10	10	10	10	10	10	10	10	10	10
root->left (Plain Binary Tree)	null	null	5	5	5	5	5	5	5	5	5
root->right (Plain Binary Tree)	null	null	null	15	15	15	15	15	15	15	15
root (BST)	null	null	null	null	null	10	10	10	10	10	10
root->left (BST)	null	null	null	null	null	null	5	5	5	5	5
root->right (BST)	null	null	null	null	null	null	null	15	15	15	15

Key Moments - 3 Insights

Why does searching in a plain binary tree take longer than in a BST?

Because in the plain binary tree (see step 4), we may need to check every node since there is no order. In BST (steps 8-10), we decide to go left or right, reducing nodes checked.

How does BST maintain order when inserting nodes?

BST inserts nodes by comparing values: smaller go left, larger go right (steps 6 and 7). This keeps the tree ordered for efficient search.

What happens if the searched value is not in the BST?

The search goes down the tree following comparisons until it reaches a null pointer (step 10), then stops and returns not found.

Visual Quiz - 3 Questions

Look at the execution table, at which step does the BST insert the node with value 15?

A Step 6

B Step 3

C Step 7

D Step 2

💡 Hint

Check the 'Operation' column for BST insertions in the execution_table.

At which step does the plain binary tree search find the value 15?

A Step 8

B Step 4

C Step 10

D Step 9

💡 Hint

Look at the 'Operation' and 'Visual State' columns for plain binary tree search.

If we insert nodes in random order without BST rules, how does search time change?

A It becomes slower, possibly O(n)

B It stays the same as BST

C It becomes faster than BST

D It becomes constant time

💡 Hint

Refer to the concept_flow showing search time differences between plain binary tree and BST.

Concept Snapshot

Plain Binary Tree: Insert nodes anywhere, no order.
Search may check all nodes: O(n) time.
BST: Insert nodes with order (left < root < right).
Search uses order to go left/right.
Average search time: O(log n).
BST is efficient for search, insert, delete.

Full Transcript

This visualization compares a plain binary tree and a binary search tree (BST). In a plain binary tree, nodes are inserted without order, so searching requires checking many nodes, leading to O(n) time. In a BST, nodes are inserted with the rule that left child is smaller and right child is larger than the root. This order allows searching by comparing values and moving left or right, reducing search time to O(log n) on average. The execution table shows step-by-step insertion and search in both trees, highlighting how BST improves efficiency. Key moments clarify why BST is faster and how it maintains order. The quiz tests understanding of insertion steps and search behavior.

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