Given a Binary Search Tree, the task is to find the node with the maximum value in a BST.
For the above tree, we start with 20, then we move right 22, we keep on moving to right until we see NULL. Since right of 22 is NULL, 22 is the node with maximum value.
Approach: This is quite simple. Just traverse the node from root to right recursively until right is NULL. The node whose right is NULL is the node with maximum value.
Maximum value in BST is 6
- Find the node with minimum value in a Binary Search Tree
- Find the maximum node at a given level in a binary tree
- Search a node in Binary Tree
- Insert a node in Binary Search Tree Iteratively
- Postorder predecessor of a Node in Binary Search Tree
- Get maximum left node in binary tree
- Maximum difference between node and its ancestor in Binary Tree
- Sum and Product of minimum and maximum element of Binary Search Tree
- Find the Deepest Node in a Binary Tree
- Find mirror of a given node in Binary tree
- Find distance from root to given node in a binary tree
- Find n-th node in Postorder traversal of a Binary Tree
- Find n-th node in Preorder traversal of a Binary Tree
- Find the closest element in Binary Search Tree
- Find the closest element in Binary Search Tree | Space Efficient Method