Data Structures for Coding Interviews in Java/

...

/

Solution: Find kth Maximum Value in Binary Search Tree

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 kthk^{th} maximum value in the tree.

Constraints:

  • The number of nodes in the tree is n.

  • 1≤1 \leq k ≤\leq n ...

Ask