Binary Tree Upside Down

Transform a binary tree by flipping it upside down so the original leftmost node becomes the new root and each parent becomes the right child while the original right child becomes the left child. The challenge is to rewire node pointers along the left spine (in-place, O(n) time) to produce the new tree structure.