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 shortcut 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
 Fall '08
 Kooshesh,A
 Data Structures, Articles with example pseudocode, Tree traversal, Nested set model

Click to edit the document details