Kth Smallest Element in BST in DSA Rust - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a Binary Search Tree (BST)?

A Binary Search Tree is a tree where each node has at most two children. The left child's value is less than the parent's value, and the right child's value is greater. This property helps in fast searching and sorting.

beginner

What does 'Kth smallest element in BST' mean?

It means finding the element that would appear in position K if all elements of the BST were sorted in ascending order.

intermediate

How can in-order traversal help find the Kth smallest element in a BST?

In-order traversal visits nodes in ascending order for BSTs. By counting nodes during this traversal, the Kth visited node is the Kth smallest element.

intermediate

What is the time complexity of finding the Kth smallest element using in-order traversal?

The time complexity is O(H + K), where H is the height of the tree. This is because traversal stops once the Kth element is found, not necessarily visiting all nodes.

intermediate

Why is it efficient to stop traversal once the Kth smallest element is found?

Stopping early avoids visiting unnecessary nodes, saving time especially in large trees. This makes the search faster than traversing the entire tree.

What traversal method is best to find the Kth smallest element in a BST?

A Post-order traversal

B Pre-order traversal

C Level-order traversal

D In-order traversal

In-order traversal visits nodes in ascending order in a BST, making it ideal to find the Kth smallest element.

If K is 1, what element does the Kth smallest element represent in a BST?

A The largest element

B The smallest element

C The root element

D The middle element

The 1st smallest element is the smallest element in the BST.

What is the main property of BST nodes that helps in finding the Kth smallest element?

A Left child is smaller and right child is greater than parent

B Right child is smaller than parent

C Left child is greater than parent

D Nodes have equal values

In BST, left child nodes are smaller and right child nodes are greater than the parent node.

What happens if K is larger than the number of nodes in the BST?

A Returns null or error

B Returns the largest element

C Returns the root element

D Returns the smallest element

If K is larger than the total nodes, the Kth smallest element does not exist, so null or an error is returned.

Which data structure can help keep track of the count during traversal?

A Stack

B Queue

C Counter variable

D Hash map

A simple counter variable can track how many nodes have been visited during in-order traversal.

Explain how to find the Kth smallest element in a BST using in-order traversal.

Think about visiting nodes in sorted order and counting them.

Describe the properties of a BST that make finding the Kth smallest element efficient.

Focus on the BST structure and traversal benefits.

Practice

1. What does the Kth Smallest Element in BST problem ask you to find?

easy

A. The largest element in the BST

B. The element that is the Kth smallest when the BST elements are sorted

C. The root node of the BST

D. The height of the BST

Solution

1. Step 1: Understand BST property

   A Binary Search Tree (BST) stores elements so that left child nodes are smaller and right child nodes are larger.

2. Step 2: Define Kth smallest element

   The Kth smallest element is the element that appears in position K when all elements are sorted in ascending order.

3. Final Answer:

   The element that is the Kth smallest when the BST elements are sorted -> Option B

4. Quick Check:

   Kth smallest = Kth element in sorted order [OK]

Hint: Think sorted order of BST nodes in ascending order [OK]

Common Mistakes:

• Confusing Kth smallest with largest element
• Thinking root is always Kth smallest
• Mixing up height with element value

2. Which Rust code snippet correctly defines a BST node struct for the Kth smallest element problem?

easy

A. struct TreeNode { val: i32, left: Option, right: Option }

B. struct TreeNode { val: i32, left: TreeNode, right: TreeNode }

C. struct TreeNode { val: i32, left: &TreeNode, right: &TreeNode }

D. struct TreeNode { val: i32, left: Option<TreeNode>, right: Option<TreeNode> }

Solution

1. Step 1: Understand Rust ownership for trees

   Rust requires heap allocation for recursive types, so child nodes use Box wrapped in Option for nullable children.

2. Step 2: Check each struct definition

   Option is correct; direct TreeNode fields cause infinite size; references need lifetimes and are not owned.

3. Final Answer:

   struct TreeNode { val: i32, left: Option, right: Option } -> Option A

4. Quick Check:

   Use Option for child nodes [OK]

Hint: Use Option for recursive tree nodes in Rust [OK]

Common Mistakes:

• Using direct TreeNode fields causing infinite size error
• Using references without lifetimes
• Not wrapping children in Option for nullability

3. Given this Rust code snippet for inorder traversal to find the Kth smallest element, what will be printed?

fn inorder(root: &Option, k: &mut i32, result: &mut Option<i32>) {
    if let Some(node) = root {
        inorder(&node.left, k, result);
        *k -= 1;
        if *k == 0 {
            *result = Some(node.val);
            return;
        }
        inorder(&node.right, k, result);
    }
}

// BST: 3 <- 5 -> 7, k = 2
let root = Some(Box::new(TreeNode { val: 5, left: Some(Box::new(TreeNode { val: 3, left: None, right: None })), right: Some(Box::new(TreeNode { val: 7, left: None, right: None })) }));
let mut k = 2;
let mut result = None;
inorder(&root, &mut k, &mut result);
println!("{:?}", result);

medium

A. Some(5)

B. Some(3)

C. Some(7)

D. None

Solution

1. Step 1: Perform inorder traversal on BST

   Inorder visits nodes in ascending order: 3, 5, 7.

2. Step 2: Decrement k and check when k == 0

   Visit 3: k=2->1; Visit 5: k=1->0, result=5, stop traversal.

3. Final Answer:

   Some(5) -> Option A

4. Quick Check:

   2nd smallest in [3,5,7] is 5 [OK]

Hint: Inorder traversal gives sorted order; pick Kth visited node [OK]

Common Mistakes:

• Confusing preorder or postorder with inorder
• Not decrementing k correctly
• Not stopping traversal after finding Kth element

4. Identify the bug in this Rust function to find the Kth smallest element in a BST:

fn kth_smallest(root: &Option, k: &mut i32) -> Option<i32> {
    if let Some(node) = root {
        let left = kth_smallest(&node.left, k);
        *k -= 1;
        if *k == 0 {
            return Some(node.val);
        }
        let right = kth_smallest(&node.right, k);
        return right;
    }
    None
}

medium

A. The function does not handle the case when k is initially zero

B. The function does not decrement k before checking left subtree

C. The function does not return None when root is None

D. The function does not stop traversal after finding the Kth element

Solution

1. Step 1: Analyze traversal and return logic

   The function returns Some(value) when Kth element found, but recursive calls continue after that.

2. Step 2: Check if traversal stops after finding Kth element

   Because recursive calls continue, traversal does not stop immediately, causing unnecessary work or wrong results.

3. Final Answer:

   The function does not stop traversal after finding the Kth element -> Option D

4. Quick Check:

   Traversal must stop once Kth element found [OK]

Hint: Stop recursion immediately after finding Kth element [OK]

Common Mistakes:

• Not returning early after finding Kth element
• Incorrect k decrement order
• Ignoring None base case

5. You have a BST with nodes inserted in this order: 6, 2, 8, 0, 4, 7, 9, 3, 5. What is the 4th smallest element in this BST?

hard

A. 6

B. 5

C. 4

D. 3

Solution

1. Step 1: List BST elements in sorted order

   Inorder traversal of BST gives sorted nodes: 0, 2, 3, 4, 5, 6, 7, 8, 9.

2. Step 2: Identify 4th smallest element

   The 4th element in this sorted list is 4.

3. Final Answer:

   4 -> Option C

4. Quick Check:

   Sorted nodes: 0,2,3,4,... 4th is 4 [OK]

Hint: Inorder traversal lists BST nodes sorted; pick Kth element [OK]

Common Mistakes:

• Counting nodes incorrectly
• Confusing insertion order with sorted order
• Off-by-one errors in K counting