https://adeveloperdiary.github.io/algorithm/tree/kth-smallest-element-in-a-bst/