K-th SMALLEST ELEMENT IN A BINARY SEARCH TREE | LEETCODE # 230 | PYTHON INORDER DFS SOLUTION
In this video we are solving a popular Tree based interview question: Kth Smallest Element in a Binary Search Tree (Leetcode # 230).
On the surface this question is really quite simple because we can do an inorder traversal of the tree to get our answer quite easily but most interviewers will ask that you don't use the typical way of traversing the entire tree first but instead ask you do it iteratively. This is trickier because the iterative inorder traversal is harder to code and tests your understanding of an inorder traversal.