Interview Questions
Interview Guides
Experiences
Explore
Get started
Sign in
Interview Guides
All questions
/
Coding
Kth Largest in BST
Hard
B
Asked at 1 company
space complexity
Trees
Problem
Given a BST, find the kth largest element without using extra space for a full traversal.
Question
Answer
Problem
Given a BST, find the kth largest element without using extra space for a full traversal.
Your answer
Edit
Preview
Try one AI text evaluation on us
Get structured feedback, scored against a 4-axis rubric. Premium unlocks unlimited.
0 words
target ~200
Try a free preview
Stuck? Get a hint
Past attempts
Up next
B
Kth Largest Element
Medium
T
Kth Largest Element Approach
Medium
Kth Largest Element Efficiently
Medium
Next question
Kth Largest in BST | Dataford Interview Questions
