C-4.1 Show that any n-node binary tree can be converted to any other n-node binary tree using O(n) rotations. Hint: Show that O(n) rotations suffice to convert any binary tree into a left chain, where each internal node has an external right child