Midterm 2 Review

Recallthattheheightofthebinarysearchtreeisdefinedasthe

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: + 22 + … + 2m 18) Given the following list of jobs (the list contains their processing times), display how the jobs are assigned to machines by the LPT algorithm. (LPT algorithm is not described in the text, but can be found in the class notes.) (2, 14, 3, 4, 16, 6, 5, 3, 8) 19) Exhibit the binary search tree that results by inserting the following sequence of keys: 8, 11, 3, 12, 35, 8, 14, 23, 1. 20) What is the height of the above tree? What is the depth of the node containing the key 14? Recall that the height of the binary search tree is defined as the number of edges in the longest path from root to a leaf. 21) There are 24 possible ways in which we could insert the keys 1, 2, 3 and 4 into a (initially empty) binary search tree. Of these, how many would result in a tree of height = 3? (For example, the sequence 1, 4, 3, 2 will produce such a tree.) Answer the same question for the collection {1, 2, 3} and {1, 2}. Can you guess a general formula for the number of input orders that res...
View Full Document

This note was uploaded on 02/08/2014 for the course CS 315 taught by Professor Kooshesh,a during the Fall '08 term at Sonoma.

Ask a homework question - tutors are online