BST Property and Why It Matters in DSA C - Time & Space Complexity

Time Complexity: BST Property and Why It Matters

O(h)

Understanding Time Complexity

We want to understand how the special rule of a Binary Search Tree (BST) affects how fast we can find or add items.

The question is: How does this rule help us do tasks faster as the tree grows?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

// Check if a value exists in a BST
int searchBST(Node* root, int val) {
    if (root == NULL) return 0;
    if (root->data == val) return 1;
    if (val < root->data) return searchBST(root->left, val);
    else return searchBST(root->right, val);
}
    

This code looks for a value in a BST by following the BST rule to decide which side to search next.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Recursive calls moving down one level of the tree.
• How many times: At most once per tree level until the value is found or tree ends.

How Execution Grows With Input

Each step moves down one level, so the number of steps grows with the tree's height.

Input Size (n)	Approx. Operations
10	About 4 steps (tree height)
100	About 7 steps
1000	About 10 steps

Pattern observation: Steps grow slowly as tree size grows, roughly like the height of a balanced tree.

Final Time Complexity

Time Complexity: O(h) where h is tree height

This means the time depends on how tall the tree is, not just how many items it has.

Common Mistake

[X] Wrong: "Searching a BST always takes the same time as searching a sorted list."

[OK] Correct: A BST search depends on tree height, which can be much less than list length if the tree is balanced.

Interview Connect

Understanding how the BST rule affects search speed shows you know why data structures matter for fast programs.

Self-Check

"What if the BST becomes a linked list (all nodes only have one child)? How would the time complexity change?"

Practice

1. What is the main property that defines a Binary Search Tree (BST)?

easy

A. All leaf nodes are at the same depth.

B. Each node has exactly two children.

C. Nodes are arranged in a complete binary tree structure.

D. For each node, all values in the left subtree are smaller, and all values in the right subtree are larger.

Solution

1. Step 1: Understand BST definition

   A BST is defined by the order property where left subtree nodes are smaller and right subtree nodes are larger than the current node.

2. Step 2: Compare options with BST property

   For each node, all values in the left subtree are smaller, and all values in the right subtree are larger. matches the BST property exactly. Other options describe different tree types or properties.

3. Final Answer:

   For each node, all values in the left subtree are smaller, and all values in the right subtree are larger. -> Option D

4. Quick Check:

   BST property = left < node < right [OK]

Hint: Remember BST orders left < node < right [OK]

Common Mistakes:

• Confusing BST with complete binary tree
• Thinking all nodes must have two children
• Assuming leaf nodes must be at same depth

2. Which of the following is the correct syntax to check if a node's left child value is less than the node's value in C?

easy

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

B. if (node.left.value < node.value) {}

C. if (node->left.value < node->value) {}

D. if (node.left->value < node.value) {}

Solution

1. Step 1: Understand C struct pointer access

   In C, to access a member of a struct pointer, use '->'. So node->left accesses left child pointer.

2. Step 2: Check each option for correct pointer syntax

   if (node->left->value < node->value) {} uses node->left->value correctly. Others mix '.' and '->' incorrectly.

3. Final Answer:

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

4. Quick Check:

   Use '->' for pointer members in C [OK]

Hint: Use '->' to access struct pointer members in C [OK]

Common Mistakes:

• Using '.' instead of '->' for pointers
• Mixing '.' and '->' incorrectly
• Forgetting to check if left child is NULL before access

3. Given the following BST insertion code snippet in C, what will be the inorder traversal output after inserting values 10, 5, 15, 3, 7?

medium

A. [15, 10, 7, 5, 3]

B. [10, 5, 15, 3, 7]

C. [3, 5, 7, 10, 15]

D. [5, 3, 7, 10, 15]

Solution

1. Step 1: Insert values into BST following property

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

2. Step 2: Perform inorder traversal (left, node, right)

   Inorder visits nodes in ascending order: 3, 5, 7, 10, 15.

3. Final Answer:

   [3, 5, 7, 10, 15] -> Option C

4. Quick Check:

   Inorder traversal of BST = sorted values [OK]

Hint: Inorder traversal of BST gives sorted order [OK]

Common Mistakes:

• Confusing preorder or postorder with inorder
• Inserting nodes incorrectly violating BST property
• Reading traversal output in insertion order

4. Consider this C code snippet for BST insertion. What is the error?

void insert(Node** root, int val) {
  if (*root == NULL) {
    *root = malloc(sizeof(Node));
    (*root)->value = val;
    (*root)->left = NULL;
    (*root)->right = NULL;
  } else if (val < (*root)->value) {
    insert(&(*root)->left, val);
  } else {
    insert(&(*root)->right, val);
  }
}

medium

A. Missing check for duplicate values before insertion.

B. No error; code correctly inserts into BST.

C. Incorrect use of pointer to pointer for root parameter.

D. Memory allocation size should be sizeof(Node*), not sizeof(Node).

Solution

1. Step 1: Analyze insertion logic for duplicates

   The code inserts values less than current node to left, else to right, so duplicates go right without check.

2. Step 2: Identify missing duplicate check

   BST usually avoids duplicates or handles them explicitly; this code lacks that check.

3. Final Answer:

   Missing check for duplicate values before insertion. -> Option A

4. Quick Check:

   Duplicates need explicit handling in BST insert [OK]

Hint: Check for duplicates before inserting in BST [OK]

Common Mistakes:

• Assuming duplicates are allowed without check
• Confusing pointer usage in recursive calls
• Incorrect malloc size for struct allocation

5. You have a BST where the property is violated at one node: the right child has a smaller value than the parent. How does this violation affect searching for a value larger than the parent in the BST?

hard

A. Search will always return the parent node regardless of the value.

B. Search may fail or return incorrect results because the BST property is broken.

C. Search will be faster because smaller values on right reduce search space.

D. Search will still work correctly because only one node is wrong.

Solution

1. Step 1: Understand BST property importance in search

   BST search relies on left < node < right property to decide which subtree to explore.

2. Step 2: Analyze effect of violation on search

   If right child is smaller, search for larger values may wrongly go left or miss nodes, causing failure or wrong results.

3. Final Answer:

   Search may fail or return incorrect results because the BST property is broken. -> Option B

4. Quick Check:

   BST property violation breaks search correctness [OK]

Hint: BST property must hold for correct search [OK]

Common Mistakes:

• Assuming one violation doesn't affect search
• Thinking search speed improves with violation
• Believing search always returns parent node