Challenge: Find minimum value in Binary Search Tree
Given the root to a Binary Search Tree, write a function to find the minimum value in that tree. A solution is placed in the "solution" section for your help, but we would suggest you solve it on your own first.
We'll cover the following
Problem Statement
Implement the find_min(root)
function which will find the minimum value in a given Binary Search Tree. Remember, a Binary Search Tree is a Binary Tree which satisfies the following property. An illustration is also provided to jog your memory.
Output
Returns minimum integer value from a given binary search tree
Sample Input
The root of an object of the BST class which contains data such as.
bst = {
6 -> 4,9
4 -> 2,5
9 -> 8,12
12 -> 10,14
}
where parent -> leftChild,rightChild
Sample Output
2
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.