Determine which node in a tree has the largest info field using a breadth first search.
Given a full tree, find the generation that has the largest info field. Use a breadth first search. ( This is too difficult for the exam.)
Find the node that is the farthest from the root.
Produce the mirror image of a tree.
Check if tree t1 is the copy of tree t2.
Write a non-void method to count the number of singletons in a tree