FunctionRacerProblemsRace

Kth Largest Value in a BST

MediumTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return the k-th largest value in the BST, counting from 1 (so k = 1 is the largest). In a binary search tree every value in a left subtree is smaller than its node and every value in a right subtree is larger.

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [3,1,4,null,2]
k 1
returns 4

The largest is 4.

Example 2

root [5,3,6,2,4,null,null,1]
k 2
returns 5

Largest first: 6, 5. The 2nd is 5.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems