Why BST Property and Why It Matters in DSA Python?

The Big Idea

What if you could find anything in a huge list almost instantly, without flipping every page?

The Scenario

Imagine you have a big phone book with thousands of names, but the pages are all mixed up randomly. You want to find a friend's number quickly, but you have to flip through every page one by one.

The Problem

Looking for a name in a messy phone book takes a long time and is tiring. You might miss the name or get frustrated flipping through so many pages. This slow search wastes your time and energy.

The Solution

A Binary Search Tree (BST) keeps all names in order, like a perfectly sorted phone book. Each page points you closer to the name you want, so you find it fast without flipping every page.

Before vs After

✗ Before

def find_name(names, target):
    for name in names:
        if name == target:
            return True
    return False

✓ After

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

def search_bst(node, target):
    if node is None:
        return False
    if node.value == target:
        return True
    elif target < node.value:
        return search_bst(node.left, target)
    else:
        return search_bst(node.right, target)

What It Enables

BST property enables lightning-fast searching, adding, and removing of items in a sorted way.

Real Life Example

Online stores use BST-like structures to quickly find products by price or name, so you get results instantly when you search.

Key Takeaways

Without BST property, searching is slow and tiring.

BST property keeps data sorted to speed up operations.

This makes programs faster and more efficient.

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