Feel free to write helper methods to help do the job. Study the code for the binary tree structure, BiTree , and its visitors . In the following, assume a binary search tree contains IOrdered elements. Write a visitor called MaxTreeFinder to find and return the subtree that contains the largest element in a binary search tree host. Write a visitor called MinTreeFinder to find and return the subtree that contains the smalles element in a binary search tree host.
Bubble sort is an elementary and very slow sorting algorithm.
You can find it in many data structures textbooks. Feel free to consult any textbook on bubble sort. Write the code to implement bubble sort to fit into Susan Merritt's sorting taxonomy.