Given a Binary Search Tree, the task is to find the node with maximum value.
Approach: Just traverse the node from root to right recursively until right is NULL. The node whose right is NULL is the node with the maximum value.
Below is the implementation of the above approach:
Time Complexity: O(n), worst case happens for right 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 minimum value in a Binary Search Tree using recursion
- Find the node with maximum value in a Binary Search Tree
- Find Maximum Level Sum in Binary Tree using Recursion
- Find the node with minimum value in a Binary Search Tree
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Find maximum count of duplicate nodes in a Binary Search Tree
- Find the maximum node at a given level in a binary tree
- Leaf nodes from Preorder of a Binary Search Tree (Using Recursion)
- Search a node in Binary 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
- Maximum height of the binary search tree created from the given array
- Get maximum left node in binary tree
- Find the closest element in Binary Search Tree
- Maximum difference between node and its ancestor in Binary Tree
- Find the closest element in Binary Search Tree | Space Efficient Method
- 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 parent of a node in the given 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 firstname.lastname@example.org. 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.