1. A level-order traversal of a tree processes (visits) nodes one level at a time, from left to right, beginning with the root. Design an algorithm that performs a level-order traversal of a binary...

1. A level-order traversal of a tree processes (visits) nodes one level at a time, from left to right, beginning with the root. Design an algorithm that performs a level-order traversal of a binary tree.

2. Add an overloaded == operator to the class Binary Node Tree .

3. Given an unbalanced binary search tree, use an in order traversal to copy its data to an array. Then create a balanced binary search tree using the read Tree algorithm given in Section 16.4 , but use your array instead of a fi le.