Why BST Over Plain Binary Tree in DSA C - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

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

Consider you want to find a value in a tree structure. Why would a Binary Search Tree (BST) be better than a plain Binary Tree?

A BST does not require pointers to child nodes, unlike a plain Binary Tree.

B BST uses less memory than a plain Binary Tree because it stores fewer nodes.

C BST can store duplicate values while a plain Binary Tree cannot.

D BST allows faster searching because it keeps elements in a sorted order, enabling binary search.

💡 Hint

Think about how the order of elements affects the speed of finding a value.

A BST keeps nodes in sorted order, so searching can skip half the tree at each step, making it faster than searching a plain Binary Tree where nodes are unordered.

❓ Predict Output

intermediate

Output of searching a value in BST vs Plain Binary Tree

Given the following trees, what will be the output when searching for value 7?

DSA C

/* BST structure: 5
   /   \
  3     8
 / \   / \
1   4 7   9

Plain Binary Tree structure:
    5
   / \
  8   3
 / \   \
9   7   1

Search function returns true if found, false otherwise. */

A {"BST_search": true, "PlainTree_search": true}

B {"BST_search": true, "PlainTree_search": false}

C {"BST_search": false, "PlainTree_search": true}

D {"BST_search": false, "PlainTree_search": false}

💡 Hint

Check if value 7 exists in both trees.

Value 7 is present in both trees, so searching returns true for both.

🔧 Debug

advanced

Why does searching in a plain Binary Tree take longer than in a BST?

Consider the search algorithm for a plain Binary Tree and a BST. Why might the plain Binary Tree search take longer?

DSA C

/* Plain Binary Tree search checks every node because nodes are unordered.
   BST search decides to go left or right based on value comparison.
*/

A Plain Binary Tree search must check all nodes because there is no order to skip branches.

B Plain Binary Tree search uses recursion which is slower than iteration used in BST search.

C Plain Binary Tree search uses more memory causing slower performance.

D Plain Binary Tree search is slower because it stores duplicate values.

💡 Hint

Think about how ordering helps skip parts of the tree.

Without order, the plain Binary Tree search must check every node, making it slower than BST search which can skip branches.

❓ Predict Output

advanced

Resulting tree structure after inserting 6 into BST and Plain Binary Tree

Given these trees, what will be the in-order traversal output after inserting value 6?

DSA C

/* Initial BST:
    5
   / \
  3   8
 / \   \
1   4   9

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

Insert 6 into both trees.
In-order traversal prints nodes in ascending order for BST.
*/

A {"BST_inorder": [1,3,4,5,6,8,9], "PlainTree_inorder": [1,3,4,5,6,8,9]}

B {"BST_inorder": [1,3,4,5,8,9], "PlainTree_inorder": [1,3,4,5,6,8,9]}

C {"BST_inorder": [1,3,4,5,6,8,9], "PlainTree_inorder": [1,3,5,8,6,9]}

D {"BST_inorder": [1,3,4,5,6,8,9], "PlainTree_inorder": [1,3,5,6,8,9]}

💡 Hint

Remember that in-order traversal of BST is sorted, but plain Binary Tree is not guaranteed sorted.

BST insertion keeps order, so in-order traversal is sorted including 6. Plain Binary Tree insertion does not guarantee order, so traversal order differs.

🚀 Application

expert

Choosing data structure for fast search and ordered data retrieval

You need a data structure to store numbers that allows fast search and also lets you retrieve numbers in sorted order efficiently. Which is the best choice?

A Use a plain Binary Tree because it is simple and stores data hierarchically.

B Use a Binary Search Tree because it supports fast search and in-order traversal gives sorted data.

C Use a linked list because it allows easy insertion and traversal.

D Use a hash table because it provides constant time search and maintains order.

💡 Hint

Think about which structure supports both fast search and sorted order retrieval.

Binary Search Tree supports fast search by ordering nodes and allows in-order traversal to retrieve sorted data. Plain Binary Tree and linked list do not guarantee order or fast search. Hash tables do not maintain order.

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