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.
- Find the node with maximum value in a Binary Search Tree using recursion
- Find the node with minimum value in a Binary Search Tree
- Find the node with maximum value in a Binary Search Tree
- Leaf nodes from Preorder of a Binary Search Tree (Using Recursion)
- Search a node in Binary Tree
- Minimum swap required to convert binary tree to binary search tree
- Postorder predecessor of a Node in Binary Search Tree
- Insert a node in Binary Search Tree Iteratively
- Sum and Product of minimum and maximum element of Binary Search Tree
- Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree
- Find mirror of a given node in Binary tree
- Find the Deepest Node in a Binary Tree
- Find the maximum node at a given level in a binary tree
- Find distance from root to given node in a binary tree
- Find n-th node in Preorder traversal of a Binary 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.