Hint : Inorder(left->root->right) traversal of BST gives a ascending sorted array,so the minimum value node should lie in left most node of left sub-tree.In the figure shown above “Node 1” is the minimum value node.

Step 1 :If the node is null ,then return null.

Step 2 :Traverse the tree from root to left sub tree till we reach null.

Step 3 :The node found by step 2 is the node with minimum value(left most leaf).

About the Author

Dear Friends,
I am A.K.M. .This online journal ai1tutorial.com is a humble effort from my side to all students and professionals who want to learn computer science related technologies.I am not a professional blogger and I write posts in this blog only in my leisure time.I may not be 100% perfect in all my posts,but your review comments can surely help me to make it 100% perfect.