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
- 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 minimum value in a Binary Search Tree
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Find Maximum Level Sum in Binary Tree using Recursion
- Binary Tree to Binary Search Tree Conversion using STL set
- Binary Tree to Binary Search Tree Conversion
- Minimum swap required to convert binary tree to binary search tree
- Difference between Binary Tree and Binary Search Tree
- Binary Search Tree | Set 1 (Search and Insertion)
- Find maximum count of duplicate nodes in a Binary Search Tree
- 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
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Find the value of ln(N!) using Recursion
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.