Given a Binary Search Tree, the task is to find the node with minimum value.
Approach: Just traverse the node from root to left recursively until left is NULL. The node whose left is NULL is the node with the minimum value.
Below is the implementation of the above approach:
Time Complexity: O(n), worst case happens for left skewed trees.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find the node with maximum value in a Binary Search Tree using recursion
- Find the node with minimum value in a Binary Search Tree
- Leaf nodes from Preorder of a Binary Search Tree (Using Recursion)
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Find the node with maximum value in a Binary Search Tree
- Minimum swap required to convert binary tree to binary search tree
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Binary Tree to Binary Search Tree Conversion using STL set
- Binary Tree to Binary Search Tree Conversion
- Difference between Binary Tree and Binary Search Tree
- Binary Search Tree | Set 1 (Search and Insertion)
- Find Maximum Level Sum in Binary Tree using Recursion
- Zig-Zag traversal of a Binary Tree using Recursion
- Bottom View of a Binary Tree using Recursion
- Insert a node in Binary Search Tree Iteratively
- Search a node in Binary Tree
- Postorder predecessor of a Node in Binary Search Tree
- Convert a Binary Search Tree into a Skewed tree in increasing or decreasing order
- Count the Number of Binary Search Trees present in a Binary Tree
- Sum and Product of minimum and maximum element of Binary Search Tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.