Assuming that a binary tree holds a list of symbols arranged alphabetically (as in the examples on page 366), write a function that prints all of the symbols in alphabetic order. Hint: Use recursion.

Write a function that balances an unbalanced binary tree. The function should accept one argument, which is a pointer to the top of the binary tree. How efficient is your algorithm?