BST property and invariant in Data Structures Theory - Mini Project: Build & Apply

Understanding BST Property and Invariant

📖 Scenario: Imagine you are organizing books on a shelf so that you can find any book quickly. You decide to arrange them so that all books with titles alphabetically before a certain book are on the left, and all books with titles alphabetically after are on the right. This is similar to how a Binary Search Tree (BST) organizes data.

🎯 Goal: You will build a simple representation of a BST property and invariant using a dictionary to understand how data is organized and checked in a BST.

📋 What You'll Learn

Create a dictionary representing nodes with their values

Add a variable to represent the root node value

Write a condition to check the BST property for left and right children

Add a final statement confirming the BST invariant holds

💡 Why This Matters

🌍 Real World

BSTs are used in databases and file systems to organize data for quick search, insertion, and deletion.

💼 Career

Understanding BST properties is essential for software developers working with data structures, algorithms, and performance optimization.

1

Create the BST nodes dictionary

Create a dictionary called nodes with these exact entries: 'root': 10, 'left_child': 5, 'right_child': 15.

Data Structures Theory

# Create the nodes dictionary with root, left_child, and right_child
# Your code here

Hint

Use a dictionary with keys 'root', 'left_child', and 'right_child' and assign the values 10, 5, and 15 respectively.

2

Set the root value variable

Create a variable called root_value and set it to the value of the root node from the nodes dictionary.

Data Structures Theory

nodes = {'root': 10, 'left_child': 5, 'right_child': 15}
# Set root_value to nodes['root']
# Your code here

Hint

Access the root value from the dictionary using the key 'root' and assign it to root_value.

3

Check the BST property for children

Write a condition using if that checks if the left child's value is less than root_value and the right child's value is greater than root_value. Use nodes['left_child'] and nodes['right_child'] to get the children values.

Data Structures Theory

nodes = {'root': 10, 'left_child': 5, 'right_child': 15}
root_value = nodes['root']
# Check if left_child < root_value < right_child
# Your code here

Hint

Use a chained comparison to check the BST property and assign True or False to bst_property_holds.

4

Confirm the BST invariant

Add a final variable called bst_invariant and set it to the value of bst_property_holds to confirm the BST property is maintained.

Data Structures Theory

nodes = {'root': 10, 'left_child': 5, 'right_child': 15}
root_value = nodes['root']
if nodes['left_child'] < root_value < nodes['right_child']:
    bst_property_holds = True
else:
    bst_property_holds = False
# Set bst_invariant to bst_property_holds
# Your code here

Hint

Assign the result of the BST property check to bst_invariant to confirm the invariant.

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