# Show that any n-node binary tree can be converted to any other n-node binary tree using O(n) rotations.

Chapter 11, Exercises #32

Show that any n-node binary tree can be converted to any other n-node binary tree using O(n) rotations.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

## Data Structures and Algorithms in Java

6th edition

Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

ISBN: 978-1118771334