Challenge: Find kth Maximum Value in Binary Search Tree

Try to solve the Find kth Maximum Value in Binary Search Tree problem.

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 ≤500\leq 500

  • 0≤0 \leq Node.data ≤104\leq 10^4

Examples

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