Solution: Find kth Maximum Value in Binary Search Tree

Let’s solve the Find kth Maximum Value in Binary Search Tree problem.

We'll cover the following


Given the root node of a binary search tree and an integer value k, return the kthk^{th} maximum value in the tree.


  • The number of nodes in the tree is n.

  • 11 \leq k \leq n 500\leq 500

  • 00 \leq 104\leq 10^4


For this solution, we will recursively perform the inorder traversal (right subtree, root, left subtree) on the binary search tree. We will use the inorder traversal to get elements in sorted order.

While performing the inorder traversal on the tree, decrement kk by 1, indicating the number of maximum elements that still need to be found. After decrementing kk, we check whether the value of kk has reached 00. If it is 00, we return the current node, indicating the node having the kthk^{th} maximum element. If not, continue the traversal.

This approach ensures that we traverse the tree in a depth-first manner while appropriately updating k and effectively finding the kthk^{th} maximum element.

Now, let’s look at the following illustration to get a better understanding of the solution:

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.