BST property and invariant in Data Structures Theory - Time & Space Complexity

Time Complexity: BST property and invariant

O(h)

Understanding Time Complexity

We want to understand how the rules of a Binary Search Tree affect how fast we can find or add items.

Specifically, how does the tree's structure influence the work needed as it grows?

Scenario Under Consideration

Analyze the time complexity of searching a value in a Binary Search Tree (BST).

function searchBST(node, target) {
  if (node == null) return false;
  if (node.value === target) return true;
  if (target < node.value) {
    return searchBST(node.left, target);
  } else {
    return searchBST(node.right, target);
  }
}
    

This code looks for a target value by following the BST rule: left child is smaller, right child is bigger.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Recursive calls moving down one tree level at a time.
• How many times: At most once per level, until the target is found or a leaf is reached.

How Execution Grows With Input

Each step moves down one level, so the work depends on the tree's height.

Input Size (n)	Approx. Operations (levels visited)
10	About 3 to 10 steps depending on tree shape
100	About 7 to 100 steps depending on tree shape
1000	About 10 to 1000 steps depending on tree shape

Pattern observation: If the tree is balanced, steps grow slowly with input size; if unbalanced, steps can grow as large as the number of nodes.

Final Time Complexity

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

This means the time to search 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 the number of items (O(n))."

[OK] Correct: Because the BST property lets us skip half the tree at each step if balanced, so time depends on height, not total items.

Interview Connect

Understanding how the BST property controls search speed shows you can reason about data structure efficiency, a key skill in coding interviews.

Self-Check

"What if the BST becomes a linked list (completely unbalanced)? How would the time complexity change?"

Practice

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

easy

A. All nodes have exactly two children.

B. Nodes are arranged in a circular linked list.

C. Left child nodes are smaller, right child nodes are larger than the parent node.

D. Each node stores a unique key with no order.

Solution

1. Step 1: Understand BST node arrangement

   A BST arranges nodes so that left children have smaller values and right children have larger values than their parent node.

2. Step 2: Compare options with BST definition

   Left child nodes are smaller, right child nodes are larger than the parent node. correctly states this property. Other options describe different or incorrect structures.

3. Final Answer:

   Left child nodes are smaller, right child nodes are larger than the parent node. -> Option C

4. Quick Check:

   BST property = left < parent < right [OK]

Hint: Remember BST means left smaller, right larger [OK]

Common Mistakes:

• Thinking all nodes must have two children
• Confusing BST with other tree types
• Ignoring the order property in BST

2. Which of the following is the correct way to check if a node's left child maintains the BST property?

easy

A. left_child.value > node.value

B. left_child.value < node.value

C. left_child.value == node.value

D. left_child.value >= node.value

Solution

1. Step 1: Recall BST left child rule

   In a BST, the left child's value must be less than the parent's value.

2. Step 2: Match this rule to options

   left_child.value < node.value correctly states left_child.value < node.value. Other options violate this rule.

3. Final Answer:

   left_child.value < node.value -> Option B

4. Quick Check:

   Left child < parent [OK]

Hint: Left child must be smaller than parent [OK]

Common Mistakes:

• Using greater than or equal instead of less than
• Allowing equal values on left child
• Confusing left and right child rules

3. Given the BST below, what is the correct in-order traversal output?

      10
     /  \
    5    15
   / \     \
  3   7     20

medium

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

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

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

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

Solution

1. Step 1: Understand in-order traversal

   In-order traversal visits left subtree, then node, then right subtree, producing sorted order in BST.

2. Step 2: Traverse the tree in-order

   Left subtree of 10: nodes 3, 5, 7 in order; then 10; then right subtree 15, 20.

3. Final Answer:

   [3, 5, 7, 10, 15, 20] -> Option A

4. Quick Check:

   In-order traversal = sorted nodes [OK]

Hint: In-order traversal of BST gives sorted list [OK]

Common Mistakes:

• Confusing pre-order or post-order with in-order
• Listing nodes in insertion order
• Reversing the traversal order

4. Consider the following BST insertion code snippet. What is the error?

def insert(node, value):
    if node is null:
        return Node(value)
    if value < node.value:
        node.left = insert(node.left, value)
    else:
        node.right = insert(node.right, value)
    return node

medium

A. The code does not handle duplicate values correctly.

B. The base case for node is incorrect.

C. The recursive calls do not update the tree.

D. The function does not return the updated node.

Solution

1. Step 1: Analyze duplicate handling in insertion

   The code inserts duplicates into the right subtree without restriction, which may violate BST uniqueness if duplicates are not allowed.

2. Step 2: Check other parts of the code

   Base case and recursive updates are correct; function returns updated node properly.

3. Final Answer:

   The code does not handle duplicate values correctly. -> Option A

4. Quick Check:

   Duplicates need special handling in BST insert [OK]

Hint: Check how duplicates are treated in insertion [OK]

Common Mistakes:

• Assuming duplicates are automatically handled
• Ignoring return statements in recursion
• Confusing base case with recursive case

5. You want to verify if a binary tree is a valid BST. Which approach correctly checks the BST property for all nodes?

hard

A. Check if the tree has unique values only.

B. Check if the tree is balanced and has no cycles.

C. Check if each node's left child is smaller and right child is larger, recursively.

D. Check if all left descendants are smaller and all right descendants are larger than the node, using min and max limits.

Solution

1. Step 1: Understand BST validation requirements

   Each node must satisfy that all nodes in its left subtree are smaller and all in right subtree are larger, not just immediate children.

2. Step 2: Evaluate approaches

   Check if all left descendants are smaller and all right descendants are larger than the node, using min and max limits. uses min and max limits to ensure all descendants satisfy BST property, which is correct. Check if each node's left child is smaller and right child is larger, recursively. only checks immediate children, which is insufficient.

3. Final Answer:

   Check if all left descendants are smaller and all right descendants are larger than the node, using min and max limits. -> Option D

4. Quick Check:

   BST validation requires range checks, not just immediate children [OK]

Hint: Use min/max limits to validate BST recursively [OK]

Common Mistakes:

• Checking only immediate children values
• Confusing BST property with tree balance
• Assuming unique values guarantee BST