Find the k-th smallest element in a binary search tree.
Anonymous
Do inorder traversal while putting the elements in a list, once done you know the index/position you want the element at so get it.
Check out your Company Bowl for anonymous work chats.