CS1081205b

CS1081205b - Computer Science Foundation Exam August 12,...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science Foundation Exam August 12, 2005 Computer Science Section 1B No Calculators! Name: SSN: Score: / 50 In this section of the exam, there are four (4) problems. You must do all of them. The weight of each problem in this section is indicated with the problem. Partial credit cannot be given unless all work is shown and is readable. Be complete, yet concise, and above all be neat . KEY Solutions and Grading Criteria
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 1. [12 points] (a – 6 points) Construct a binary search tree from the values shown below. The values appear in the order in which they are input to the binary search tree construction process. Input Values: 40, 35, 60, 74, 58, 37, 70, 36, 20, 50 (b – 6 points) List the order in which the nodes in the tree shown below are visited in a postorder traversal. The order the nodes are visited in postorder traversal is: 50 46 27 35 56 69 18 30 78 40 38 40 35 60 58 50 37 20 74 70 36 38 35 40 18 50 27 50 78 30 46 56 69 Tree must be drawn in the order the values appear. If another order is used deduct entire 6 pts. If final tree is not a valid search tree deduct entire 6 pts.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

CS1081205b - Computer Science Foundation Exam August 12,...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online