search the most right node from root. If the most right root has no child, return its parent; otherwise return the largest number of its left child tree
search the most right node from root. If the most right root has no child, return its parent; otherwise return the largest number of its left child tree