Why BST Over Plain Binary Tree in DSA C - Quick Recap

Recall & Review

beginner

What is the main difference between a Binary Search Tree (BST) and a plain Binary Tree?

A BST keeps its nodes in a sorted order where the left child is smaller and the right child is larger than the parent node, while a plain Binary Tree has no such order.

beginner

Why is searching faster in a BST compared to a plain Binary Tree?

Because BST nodes are sorted, you can decide to go left or right at each step, reducing the search space by half each time, unlike a plain Binary Tree where you may need to check every node.

intermediate

How does the structure of a BST help in efficient insertion and deletion?

Insertion and deletion in a BST maintain the sorted order, allowing these operations to be done in O(log n) time on average by navigating the tree like in searching.

intermediate

What is a major drawback of a BST compared to a plain Binary Tree?

If the BST becomes unbalanced (like a linked list), operations can degrade to O(n) time, losing the advantage over a plain Binary Tree.

beginner

In what real-life scenario would you prefer a BST over a plain Binary Tree?

When you need to quickly find, add, or remove items in a sorted collection, like a phone book or dictionary, a BST is preferred because it keeps data sorted and allows fast operations.

What property does a Binary Search Tree maintain that a plain Binary Tree does not?

A Nodes are arranged in sorted order

B Each node has exactly two children

C Nodes contain only numbers

D Tree is always balanced

BST keeps nodes sorted so left child < parent < right child, unlike a plain Binary Tree.

Why is searching in a BST generally faster than in a plain Binary Tree?

A Because BST has fewer nodes

B Because BST is sorted and halves search space each step

C Because BST uses hashing

D Because BST stores data in arrays

BST allows choosing left or right child based on comparison, reducing search space quickly.

What happens if a BST becomes unbalanced?

A Operations can become as slow as in a plain Binary Tree

B It becomes a plain Binary Tree

C It automatically balances itself

D It cannot store new nodes

An unbalanced BST can degrade to a linked list shape, making operations O(n).

Which operation benefits from the BST property?

A Storing duplicate values

B Printing all nodes in any order

C Counting total nodes

D Searching for a value

Searching is faster in BST due to sorted order guiding the search path.

When would you choose a plain Binary Tree over a BST?

A When you want sorted data

B When you need fast searching

C When order of nodes does not matter

D When you want to avoid duplicates

Plain Binary Trees are used when node order is not important.

Explain why a Binary Search Tree is preferred over a plain Binary Tree for searching operations.

Think about how the tree guides you to the correct node quickly.

Describe the main advantage and a potential drawback of using a BST compared to a plain Binary Tree.

Consider both the good and the bad sides of BST.

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