BST Find Minimum Element in DSA Go - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

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

DSA Go

func findMin(root *Node) int {
    current := root
    for current.[1] != nil {
        current = current.left
    }
    return current.val
}

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

Aleft

Bchild

Cright

Dparent

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'right' instead of 'left' to traverse.

Trying to access a non-existent 'parent' pointer.

In a BST, the minimum element is found by going to the left child repeatedly until there is no left child.

2fill in blank

medium

Complete the code to handle the case when the BST is empty.

DSA Go

func findMin(root *Node) int {
    if root == [1] {
        return -1 // or error code
    }
    current := root
    for current.left != nil {
        current = current.left
    }
    return current.val
}

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

A0

Bnil

Cfalse

Dtrue

Attempts:

3 left

💡 Hint

Common Mistakes

Checking root == 0 instead of root == nil.

Not handling empty tree case.

If the root is nil, it means the tree is empty, so we return an error code or -1.

3fill in blank

hard

Fix the error in the loop condition to correctly find the minimum element.

DSA Go

func findMin(root *Node) int {
    current := root
    for current.[1] != nil {
        current = current.left
    }
    return current.val
}

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

Aparent

Bright

Cchild

Dleft

Attempts:

3 left

💡 Hint

Common Mistakes

Using '==' instead of '!=' in the loop condition.

Checking the wrong child pointer.

The loop should continue while current.left is NOT nil, so the condition must check for != nil, not == nil.

4fill in blank

hard

Fill both blanks to complete the recursive function to find the minimum element.

DSA Go

func findMin(root *Node) int {
    if root == [1] {
        return -1
    }
    if root.[2] == nil {
        return root.val
    }
    return findMin(root.left)
}

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

Anil

Broot

Cleft

Dright

Attempts:

3 left

💡 Hint

Common Mistakes

Checking root.right instead of root.left.

Not handling nil root case.

Check if root is nil first, then if root.left is nil, return root.val; else recurse left.

5fill in blank

hard

Fill all three blanks to create a function that returns the minimum node's value or -1 if empty.

DSA Go

func findMin(root *Node) int {
    if root == [1] {
        return -1
    }
    current := root
    for current.[2] != [3] {
        current = current.left
    }
    return current.val
}

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

Anil

Bleft

Dright

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'right' instead of 'left' in the loop.

Comparing to wrong nil pointer.

Check if root is nil, then loop while current.left is not nil, moving left to find minimum.