Part 9 of 15 in Binary Search Trees  

Find minimum element in a binary search tree by animeshn

Problem statement

Write a function to find the minimum element in a binary search tree of integers. A binary search tree is a binary tree in which value of all the nodes left of a node are lesser than it and value of all the nodes right of node are greater than it. You may assume that there are no duplicate values in the tree.

Input

You need to write a function named "MinNodeInBST" that will take root of a binary search tree as argument.

Output

Your function must return the minimum data value in the BST.



To try out your code



Sign in

Sign up