Name (print CLEARLY) ___________________________________ Lab Section you attend______________

Multiple Representations

21 Nov 2008

You can answer either this side of the page or the other side. We will only grade one side, so be clear about which side you want us to grade.

- Below, draw the binary search tree that results from
inserting integers in the following order:
1, 2, 3, 4, 5

- Below, draw the binary search tree that results from
inserting integers in the following order:
30, 20, 40, 10, 25, 35, 45

- Describe the most efficient way to convert a binary search tree
into an ordered list. (no code necessary, you can describe it in English.)