# 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

## Statement

Given the root node of a binary search tree and an integer value `k`

, return the

**Constraints:**

The number of nodes in the tree is

`n`

.$1 \leq$ `k`

$\leq$ `n`

$\leq 500$ $0 \leq$ `Node.data`

$\leq 10^4$

## Solution

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

This approach ensures that we traverse the tree in a depth-first manner while appropriately updating `k`

and effectively finding the

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.