Kth Largest in a BST

Find Kth largest in a BST - Given a BST and a number k, find the kth largest element in the BST.

Example

Input

Input: Tree
                [10]
               /    \
            [5]     [15]
           /   \    /   \
        [1]    [7] [11]  [18]

K = 3

Output

Output: 11

Explanation:

Node with the value of 11 is the Third Largest element in the tree.

Node structure and Given data

You're given a method to insert values in a BST. The driver code will do that for you.

class BST {
    constructor(value) {
        this.value = value;
        this.left = null;
        this.right = null;
    }
}