BST Find Minimum Element in DSA C# - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to return the minimum value in the BST.

DSA C#

public int FindMin(Node root) {
    if (root == null) return -1;
    Node current = root;
    while (current.[1] != null) {
        current = current.left;
    }
    return current.value;
}

Drag options to blanks, or click blank then click option'

Aleft

Bright

Cparent

Dchild

Attempts:

3 left

💡 Hint

Common Mistakes

Checking current.right instead of current.left

Returning root.value without traversal

Using recursion instead of iteration here

In a BST, the minimum element is found by going as far left as possible. So we check current.left in the loop.

2fill in blank

medium

Complete the code to recursively find the minimum value in the BST.

DSA C#

public int FindMinRecursive(Node root) {
    if (root == null) return -1;
    if (root.[1] == null) return root.value;
    return FindMinRecursive(root.left);
}

Drag options to blanks, or click blank then click option'

Aparent

Bleft

Cright

Dchild

Attempts:

3 left

💡 Hint

Common Mistakes

Checking right child instead of left

Not handling null root

Returning root.value without checking children

If the left child is null, the current node is the minimum. Otherwise, recurse left.

3fill in blank

hard

Fix the error in the code to correctly find the minimum value iteratively.

DSA C#

public int FindMinIterative(Node root) {
    if (root == null) return -1;
    Node current = root;
    while (current.left != [1]) {
        current = current.left;
    }
    return current.value;
}

Drag options to blanks, or click blank then click option'

Aroot

Bthis

Ccurrent

Dnull

Attempts:

3 left

💡 Hint

Common Mistakes

Using root instead of null

Using current instead of null

Using this keyword incorrectly

The loop should continue while current.left is not null to reach the leftmost node.

4fill in blank

hard

Fill both blanks to create a method that returns the minimum value or -1 if tree is empty.

DSA C#

public int GetMinValue(Node root) {
    if (root == [1]) return [2];
    Node current = root;
    while (current.left != null) {
        current = current.left;
    }
    return current.value;
}

Drag options to blanks, or click blank then click option'

Anull

B-1

Croot

D0

Attempts:

3 left

💡 Hint

Common Mistakes

Returning 0 instead of -1 for empty tree

Checking root == root instead of root == null

If root is null, return -1 to indicate empty tree.

5fill in blank

hard

Fill all three blanks to implement a recursive method that returns the minimum value or -1 if empty.

DSA C#

public int MinValue(Node root) {
    if (root == [1]) return [2];
    if (root.left == [3]) return root.value;
    return MinValue(root.left);
}

Drag options to blanks, or click blank then click option'

Anull

B-1

D0

Attempts:

3 left

💡 Hint

Common Mistakes

Returning 0 instead of -1 for empty tree

Not checking left child before recursion

Check if root is null to return -1; if left child is null, root is minimum.

Practice

1. In a Binary Search Tree (BST), where is the minimum element always located?

easy

A. At the rightmost node

B. At the root node

C. At the leftmost node

D. At any leaf node

Solution

1. Step 1: Understand BST property

   In a BST, left child nodes have smaller values than their parents.

2. Step 2: Locate minimum element

   The smallest value is found by going as far left as possible from the root.

3. Final Answer:

   At the leftmost node -> Option C

4. Quick Check:

   Minimum element = leftmost node [OK]

Hint: Minimum is always the leftmost node in BST [OK]

Common Mistakes:

• Thinking minimum is at root always
• Confusing leftmost with rightmost node
• Assuming minimum can be any leaf

2. Which of the following C# code snippets correctly finds the minimum element in a BST node named root?

easy

A. while (root.Left != null) { root = root.Left; } return root.Value;

B. while (root.Right != null) { root = root.Right; } return root.Value;

C. return root.Value;

D. while (root != null) { root = root.Left; } return root.Value;

Solution

1. Step 1: Check loop condition for minimum

   Minimum is found by moving left while left child exists.

2. Step 2: Validate code correctness

   while (root.Left != null) { root = root.Left; } return root.Value; moves left until null, then returns last node's value correctly.

3. Final Answer:

   while (root.Left != null) { root = root.Left; } return root.Value; -> Option A

4. Quick Check:

   Traverse left until null, then return value [OK]

Hint: Traverse left child until null to find minimum [OK]

Common Mistakes:

• Traversing right child instead of left
• Returning root value without traversal
• Looping until root is null causing error

3. What will be the output of the following C# code snippet?

class Node {
  public int Value;
  public Node Left, Right;
  public Node(int val) { Value = val; }
}

Node root = new Node(10);
root.Left = new Node(5);
root.Right = new Node(15);
root.Left.Left = new Node(2);
root.Left.Right = new Node(7);

Node current = root;
while (current.Left != null) {
  current = current.Left;
}
Console.WriteLine(current.Value);

medium

A. 7

B. 2

C. 5

D. 10

Solution

1. Step 1: Trace the tree structure

   Root is 10, left child 5, left-left child 2, left-right child 7.

2. Step 2: Follow the loop to find minimum

   Loop moves from 10 to 5, then to 2 (leftmost node). 2 has no left child, loop stops.

3. Final Answer:

   2 -> Option B

4. Quick Check:

   Leftmost node value = 2 [OK]

Hint: Leftmost node value is printed after loop [OK]

Common Mistakes:

• Printing root value instead of leftmost
• Confusing left-right child as minimum
• Stopping loop too early

4. Identify the error in the following C# method to find the minimum element in a BST:

int FindMin(Node root) {
  while (root != null) {
    root = root.Left;
  }
  return root.Value;
}

medium

A. The method should check root.Right instead of root.Left

B. The method should return root.Left.Value instead of root.Value

C. The method should use recursion instead of a loop

D. The loop condition should be root.Left != null, not root != null

Solution

1. Step 1: Analyze loop condition

   Loop runs while root is not null, but root becomes null after last left move.

2. Step 2: Identify cause of error

   After loop, root is null, so accessing root.Value causes error. Condition should be root.Left != null to stop at last node.

3. Final Answer:

   The loop condition should be root.Left != null, not root != null -> Option D

4. Quick Check:

   Stop before null to access valid node [OK]

Hint: Loop until root.Left is null, not root itself [OK]

Common Mistakes:

• Looping until root is null causing null reference
• Returning value after root becomes null
• Checking right child instead of left

5. Given a BST where some nodes have duplicate values, which approach correctly finds the minimum element considering duplicates are allowed only on the right subtree?

class Node {
  public int Value;
  public Node Left, Right;
  public Node(int val) { Value = val; }
}

// Duplicates go to right subtree

Which code snippet correctly finds the minimum element?

hard

A. while (root.Left != null) { root = root.Left; } return root.Value;

B. while (root.Right != null) { root = root.Right; } return root.Value;

C. return root.Value; // root is minimum due to duplicates on right

D. while (root.Left != null && root.Left.Value < root.Value) { root = root.Left; } return root.Value;

Solution

1. Step 1: Understand duplicate placement rule

   Duplicates go to right subtree, so minimum is still in leftmost path.

2. Step 2: Confirm traversal for minimum

   Traverse left child nodes until no more left child exists to find minimum.

3. Final Answer:

   while (root.Left != null) { root = root.Left; } return root.Value; -> Option A

4. Quick Check:

   Minimum is leftmost node even with duplicates on right [OK]

Hint: Duplicates on right don't affect leftmost minimum [OK]

Common Mistakes:

• Checking right subtree for minimum
• Assuming root is minimum without traversal
• Adding extra conditions unnecessarily