My end goal is to do a findKthElement function and the only way I can think of is to perform iterative inorder traversal so that I can keep a counter, which obviously doesn’t work if its recursive. I have tried my best at an implementation similar to a BST but its not working, just printing the same thing infinately. Here