Kth Largest Element in BST - Mock Interview

We do a mock interview like the ones done in Big Tech Companies. This time we try to find Binary Search Tree.
For an Ideal Solution:
Time Complexity: O(n)
Space Complexity: O(1)

Solution: https://github.com/kaustavsarkar/give...
Test: https://github.com/kaustavsarkar/give...

Do let me know your feedback in the comments.

Index:
00:00 Explain Interview Question
00:56 Approach by the candidate
03:08 Implementation
21:49 Dry Run 1st Approach
32:40 TC & SC
34:00 Optimise current solution
38:31 Self Code Review
41:00 Interview Ends
41:16 Feedback
53:32 Candidate feedback & Questions