Question: Find the Nth largest node in a BST?

Solution: Use reverse inorder

Rev_Inorder(Node* node, int counter, int N)
{
if(node == null)return;

Rev_Inorder(node->right);
counter++;
if(counter == N)
{
print(node->data);
return;
}
Rev_Inorder(node->left);

}


Call: Rev_Inorder(root, 0, N)