BST Property and Why It Matters in DSA Python - Execution Trace

Concept Flow - BST Property and Why It Matters

Start at root node

↓

Compare value to node

↓

Go left

↓

Repeat until leaf node

↓

Insert or search position found

The BST property guides us to compare values and move left or right, ensuring all left nodes are smaller and right nodes are larger or equal, helping fast search and insert.

Execution Sample

DSA Python

class Node:
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None

# Insert 5, then 3, then 7
root = Node(5)
root.left = Node(3)
root.right = Node(7)

This code creates a BST with root 5, left child 3, and right child 7, following the BST property.

Execution Table

Step	Operation	Nodes in Tree	Pointer Changes	Visual State
1	Create root node with value 5	5	root -> Node(5)	5 / . .
2	Insert 3: compare 3 < 5, go left	5 -> 3	root.left -> Node(3)	5 / 3 .
3	Insert 7: compare 7 > 5, go right	5 -> 3, 7	root.right -> Node(7)	5 / \ 3 7
4	Search for 3: compare 3 < 5, go left; found 3	5 -> 3, 7	No pointer change	5 / \ 3 7
5	Search for 6: compare 6 > 5, go right; 6 < 7, go left; left is None, not found	5 -> 3, 7	No pointer change	5 / \ 3 7
6	End of operations	5 -> 3, 7	No pointer change	5 / \ 3 7

💡 All insertions and searches follow BST property; no more nodes to insert or search.

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	After Step 4	After Step 5	Final
root.val	None	5	5	5	5	5	5
root.left	None	None	3	3	3	3	3
root.right	None	None	None	7	7	7	7
search_target	None	None	None	None	3	6	6
current_node	None	5	3	5	3	7	None

Key Moments - 3 Insights

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

Because the BST property says all left children must be smaller than the node. See execution_table step 2 where 3 < 5 leads to left insertion.

What happens if we try to insert a value equal to a node?

Usually, equal values go to the right subtree or are handled specially. In our example, we treat equal or greater as right. See concept_flow decision for >= value.

Why does searching stop when we reach a None pointer?

Because it means the value is not in the tree. In execution_table step 5, searching for 6 ends when left child of 7 is None.

Visual Quiz - 3 Questions

Look at the execution_table at step 3, what nodes are in the tree?

A 5, 3, 7

B 5, 7

C 3, 7

D 5 only

💡 Hint

Check the 'Nodes in Tree' column at step 3 in execution_table.

At which step does the search for value 3 find the node?

A Step 2

B Step 5

C Step 4

D Step 6

💡 Hint

Look at the 'Operation' column describing search for 3 in execution_table.

If we insert a value 4, where will it be placed according to the BST property?

A Left child of 3

B Right child of 3

C Left child of 5

D Right child of 7

💡 Hint

4 is greater than 3 but less than 5, so it goes to the right of 3.

Concept Snapshot

BST Property:
- Left subtree nodes < node value
- Right subtree nodes >= node value
- Enables fast search, insert, delete
- Follow comparisons from root down
- Stops at None for insert/search
- Maintains sorted order in tree

Full Transcript

The Binary Search Tree (BST) property means every node's left child is smaller and right child is larger or equal. This helps us quickly find or insert values by comparing at each node and moving left or right accordingly. We start at the root, compare the value, and go left if smaller or right if larger or equal. We repeat until we find the right spot or the value. This property keeps the tree sorted and allows fast operations. For example, inserting 3 and 7 into root 5 places 3 on the left and 7 on the right. Searching stops when we find the value or reach a None pointer, meaning the value is not present.

Practice

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

easy

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

B. All nodes have exactly two children

C. Nodes are arranged in level order

D. Each node has a pointer to its parent only

Solution

1. Step 1: Understand BST node arrangement

   In a BST, for each node, all nodes in the left subtree have smaller values and all nodes in the right subtree have larger values.

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 tree types or incorrect properties.

3. Final Answer:

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

4. Quick Check:

   BST property = Left smaller, right larger [OK]

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

Common Mistakes:

• Confusing BST with complete binary tree
• Thinking all nodes must have two children
• Assuming nodes are sorted by level

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

easy

A. if node.left.value > node.value:

B. if node.left > node.value:

C. if node.left.value == node.value:

D. if node.left.value < node.value:

Solution

1. Step 1: Understand node attribute access

   In Python, to access the left child's value, use node.left.value.

2. Step 2: Compare values for BST property

   We check if left child's value is less than the node's value, so the condition is node.left.value < node.value.

3. Final Answer:

   if node.left.value < node.value: -> Option D

4. Quick Check:

   Left child value < node value syntax [OK]

Hint: Use node.left.value to access left child's value [OK]

Common Mistakes:

• Comparing node.left directly without .value
• Using > instead of < for left child
• Using == which is incorrect for BST property

3. Consider the following Python code that inserts values into a BST:

class Node:
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None

def insert(root, val):
    if root is None:
        return Node(val)
    if val < root.val:
        root.left = insert(root.left, val)
    else:
        root.right = insert(root.right, val)
    return root

root = None
for v in [10, 5, 15, 3, 7]:
    root = insert(root, v)

print(root.left.right.val)

What is the output?

medium

A. 5

B. 7

C. 3

D. 15

Solution

1. Step 1: Trace insertion order and BST structure

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

2. Step 2: Identify root.left.right node value

   root.left is node with value 5; root.left.right is node with value 7.

3. Final Answer:

   7 -> Option B

4. Quick Check:

   root.left.right.val = 7 [OK]

Hint: Draw tree nodes to find left-right child quickly [OK]

Common Mistakes:

• Confusing left and right child positions
• Assuming insertion order is different
• Printing root.left.val instead of root.left.right.val

4. The following code attempts to check if a binary tree is a BST but has a bug:

def is_bst(node, min_val=float('-inf'), max_val=float('inf')):
    if node is None:
        return True
    if node.val < min_val or node.val > max_val:
        return False
    return is_bst(node.left, min_val, node.val) and is_bst(node.right, node.val, max_val)

What is the bug in this code?

medium

A. The function does not check for duplicate values properly

B. The base case should return false instead of true

C. The recursive calls swap min_val and max_val incorrectly

D. The comparison should use <= and >= instead of < and >

Solution

1. Step 1: Analyze BST validation logic

   The code checks if node.val is between min_val and max_val, then recursively checks left and right subtrees with updated ranges.

2. Step 2: Identify handling of duplicates

   Using < and > allows duplicates equal to node.val on both sides, which violates BST property if duplicates are not allowed or must be on one side only.

3. Final Answer:

   The function does not check for duplicate values properly -> Option A

4. Quick Check:

   Duplicates need special handling in BST checks [OK]

Hint: Check how duplicates are handled in BST validation [OK]

Common Mistakes:

• Changing base case return value incorrectly
• Swapping min_val and max_val in recursive calls
• Ignoring duplicate value rules in BST

5. You have a BST where each node stores an integer. You want to find the kth smallest element efficiently. Which property of BST helps achieve this, and what is the best approach?

hard

A. BST property doesn't help; convert BST to list and sort it to find kth element

B. BST's pre-order traversal gives sorted order; perform pre-order traversal and stop at kth element

C. BST's in-order traversal gives sorted order; perform in-order traversal and stop at kth element

D. BST's post-order traversal gives sorted order; perform post-order traversal and stop at kth element

Solution

1. Step 1: Recall BST traversal properties

   In-order traversal of BST visits nodes in ascending sorted order.

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

   Perform in-order traversal and count nodes visited; stop when count reaches k to get kth smallest element efficiently.

3. Final Answer:

   BST's in-order traversal gives sorted order; perform in-order traversal and stop at kth element -> Option C

4. Quick Check:

   In-order traversal = sorted nodes [OK]

Hint: Use in-order traversal to get sorted nodes in BST [OK]

Common Mistakes:

• Using pre-order or post-order which are not sorted
• Sorting after converting BST to list wastes time
• Ignoring BST property for efficient search