Data Structures for Coding Interviews in C#/

...

/

Challenge 2: Finding kth Maximum Value in Binary Search Tree

Challenge 2: Finding kth Maximum Value in Binary Search Tree

Given the root to a binary search tree and a number "k," write a function to find the “kth” maximum value in the tree.

We'll cover the following...

Problem statement

Implement a function int findKthMax(Node* rootNode, int k,int nodes), which will take the root of a BST, any number “k” as an input, and the total number of nodes in the tree. It will return the ...