Midterm 2 Solutions

# B a binary search tree contains the following keys 18

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: already in the tree } 5) (a) Exhibit the unique binary search tree whose preorder traversal prints the sequence 41 21 15 38 23 29 25 30. (b) A binary search tree contains the following keys: 18, 1, 3, 42, 35, 8, 14, 23, 1, 11, 55, 91. If the keys in the tree are printed using inorder traversal, what is the output sequence printed? 4 + 4 points Solution: Many of you actually constructed the binary search tree and then traversed the tree in order to get the output. A short-cut is to write sort the list above (since the inorder traversal of a BST gives a sorted sequence.) [ 1 3 8 11 14 18 23 35 42 55 91] 6) Write a procedure testHeap that takes as input an array A and an integer currentSize that represents the numbe...
View Full Document

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern