This is a question from leetcode. It says
Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is
