I can't see this being possible without destroying the tree. My solution: Right rotate at the root until the root has no left child. When this occurs, you go to its right child and either rotate until that position has no left child, or print it if it has no left child. break out of both loops when there are no children while(root has any children) ...while(root has left children) ......rotate root right ......new root = old root's parent ...print root ...new root = old root's right child