Kth Largest Element in a BST with Traversals
Filed under Cadence
The question
Find the Kth largest element in a Binary Search Tree (BST), followed by a modified in-order traversal and a bottom-up level order traversal. Also find a triplet with a given sum.
No write-up yet. Related questions below have one.
Related Cadence questions
Collected from public candidate posts and coding forums. Updated Nov 2026.