BST Property and Why It Matters in DSA C++ - Execution Trace

Concept Flow - BST Property and Why It Matters

Start at root node

↓

Compare value to node

↓

Go left

↓

Repeat until leaf

↓

Insert or find node

↓

Maintain BST property

The BST property guides where to go at each node: left for smaller, right for equal or larger, ensuring sorted order.

Execution Sample

DSA C++

struct Node {
  int val;
  Node* left;
  Node* right;
};
// Insert 5 into BST

This code inserts a value into a BST by comparing and moving left or right.

Execution Table

Step	Operation	Current Node Value	Compare With	Go Left or Right	Visual State
1	Start at root	10	5	Go left	10 / 5 -
2	Move to left child	5	5	Equal or right	10 / 5 -
3	Insert 5 here	5	5	Insert as right child	10 / 5 - \ 5
4	Done	-	-	-	10 / 5 - \ 5

💡 Insertion done when correct leaf position found maintaining BST property

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	Final
current	root (10)	left child (5)	node with value 5	insert new node (5)	inserted node (5)
tree structure	10 with left 5	10 with left 5	10 with left 5	10 with left 5 and right child 5	final tree

Key Moments - 3 Insights

Why do we go left when the value is less than the current node?

Because BST property says all left subtree nodes must be smaller, so we look left to keep order (see execution_table step 1).

Why insert as right child when value equals current node?

BST allows equal values on right side to keep consistent ordering (see execution_table step 3).

What happens if we insert at a leaf node?

We create a new node there, preserving BST property and tree structure (see execution_table step 3 and 4).

Visual Quiz - 3 Questions

Look at the execution_table, what is the current node value at step 2?

A null

B 10

C 5

D 15

💡 Hint

Check the 'Current Node Value' column at step 2 in execution_table

At which step does the insertion happen according to the execution_table?

A Step 1

B Step 3

C Step 2

D Step 4

💡 Hint

Look for 'Insert' keyword in the 'Operation' column

If the inserted value was 12 instead of 5, which direction would we go from root 10?

A Right

B Left

C Stay

D Insert at root

💡 Hint

BST property says values >= current node go right (see concept_flow)

Concept Snapshot

BST Property:
- Left subtree nodes < node value
- Right subtree nodes >= node value
- Guides search and insertion
- Maintains sorted order
- Enables fast lookup and insert

Full Transcript

The BST property means each node's left children are smaller and right children are equal or larger. When inserting or searching, start at root, compare value, go left if smaller, right if equal or larger, until leaf found. Insert new node there. This keeps the tree sorted and allows fast operations.

Practice

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

easy

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

B. Each node has exactly two children.

C. All nodes have the same value.

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

Solution

1. Step 1: Understand BST definition

   A BST requires that for every node, values in the left subtree are smaller and values in the right subtree are larger.

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, while others describe different tree types or incorrect 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 A

4. Quick Check:

   BST property = For each node, all values in the left subtree are smaller, and all values in the right subtree are larger. [OK]

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

Common Mistakes:

• Thinking BST means every node has two children
• Confusing BST with balanced or complete trees
• Assuming all nodes have the same value

2. Which of the following is the correct C++ syntax to declare a node structure for a BST?

easy

A. class Node { int data; Node left; Node right; };

B. struct Node { int data; Node left; Node right; };

C. struct Node { int data; Node* left; Node* right; };

D. class Node { int data; Node* left; Node* right; };

Solution

1. Step 1: Check pointer usage in node declaration

   BST nodes must use pointers for left and right children to allow dynamic linking.

2. Step 2: Compare struct and class syntax

   struct Node { int data; Node* left; Node* right; }; correctly uses struct with pointers. class Node { int data; Node* left; Node* right; }; uses class but misses access specifiers (defaults private). Declarations using objects instead of pointers for children are incorrect.

3. Final Answer:

   struct Node { int data; Node* left; Node* right; }; -> Option C

4. Quick Check:

   Use pointers for children in BST node [OK]

Hint: Use pointers for child nodes in BST struct [OK]

Common Mistakes:

• Using objects instead of pointers for children
• Forgetting semicolon after struct
• Using class without public access for members

3. Consider the following BST insertion code snippet in C++:

struct Node {
  int data;
  Node* left;
  Node* right;
};

Node* insert(Node* root, int val) {
  if (!root) {
    Node* newNode = new Node{val, nullptr, nullptr};
    return newNode;
  }
  if (val < root->data) root->left = insert(root->left, val);
  else root->right = insert(root->right, val);
  return root;
}

int main() {
  Node* root = nullptr;
  root = insert(root, 10);
  root = insert(root, 5);
  root = insert(root, 15);
  root = insert(root, 12);
  root = insert(root, 18);
  return 0;
}

What is the in-order traversal output of the BST after these insertions?

medium

A. [10, 12, 5, 15, 18]

B. [10, 5, 15, 12, 18]

C. [18, 15, 12, 10, 5]

D. [5, 10, 12, 15, 18]

Solution

1. Step 1: Understand insertion order and BST structure

   Inserted values: 10 (root), 5 (left), 15 (right), 12 (left of 15), 18 (right of 15).

2. Step 2: Perform in-order traversal (left, root, right)

   Traverse left subtree: 5, root: 10, left of right subtree: 12, root of right subtree: 15, right of right subtree: 18. So output is [5, 10, 12, 15, 18].

3. Final Answer:

   [5, 10, 12, 15, 18] -> Option D

4. Quick Check:

   In-order traversal of BST = sorted values [OK]

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

Common Mistakes:

• Confusing pre-order or post-order with in-order
• Ignoring BST insertion rules
• Mixing up left and right subtree traversal

4. The following code attempts to insert a value into a BST but has a bug:

Node* insert(Node* root, int val) {
  if (root == nullptr) {
    Node* newNode = new Node{val, nullptr, nullptr};
    return newNode;
  }
  if (val <= root->data) root->left = insert(root->left, val);
  else root->right = insert(root->right, val);
  return root;
}

What is the main issue with this code regarding BST property?

medium

A. It does not allocate memory for new nodes.

B. Using <= allows duplicate values on the left, which may violate strict BST property.

C. It uses recursion incorrectly causing infinite loops.

D. It does not handle the case when root is null.

Solution

1. Step 1: Analyze the condition for left subtree insertion

   The code uses val <= root->data to decide left subtree insertion, allowing duplicates on the left.

2. Step 2: Understand BST strict property

   Strict BST property requires all left subtree values to be strictly less than the node's value. Allowing duplicates on left can break this.

3. Final Answer:

   Using <= allows duplicate values on the left, which may violate strict BST property. -> Option B

4. Quick Check:

   Strict BST: left < node < right [OK]

Hint: Use < for left subtree to avoid duplicates breaking BST [OK]

Common Mistakes:

• Ignoring duplicate handling in BST
• Thinking recursion causes infinite loops here
• Assuming null root case is missing

5. You have a BST where each node stores an integer. You want to find the kth smallest element efficiently. Which approach best uses the BST property to solve this?

hard

A. Perform an in-order traversal and stop when the kth element is reached.

B. Perform a level-order traversal and count nodes until kth is found.

C. Traverse only the right subtree k times to find the kth smallest.

D. Use pre-order traversal and store all nodes in a list, then sort it.

Solution

1. Step 1: Recall BST in-order traversal property

   In-order traversal visits nodes in ascending order for BST.

2. Step 2: Use in-order traversal to find kth smallest

   By traversing in-order and counting nodes, we can stop at kth node, efficiently finding kth smallest.

3. Final Answer:

   Perform an in-order traversal and stop when the kth element is reached. -> Option A

4. Quick Check:

   In-order traversal = sorted order [OK]

Hint: In-order traversal visits nodes in ascending order [OK]

Common Mistakes:

• Using level-order which is not sorted
• Traversing only right subtree misses smaller values
• Sorting after pre-order wastes time