โ† Adobe questions

Find Kth largest element in a BST without modifying the tree

Filed under Adobe

Find the kth largest element in a Binary Search Tree (BST) without modifying the tree structure. The solution should ideally run in O(h + k) time.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Adobe questions

Collected from public candidate posts and coding forums. Updated Nov 2026.