Uber Software Engineer Tech Phone Screen: Find Kth Largest Node in BST

Interview question from Uber tech phone screen on finding the Kth largest node in a binary search tree using modified inorder traversal. Discussion on optimizing without recursion.