Blog

For the tree given in Question #1, which node(s) is/are the leaves?

Show the result (on an element by element basis) of inserting the following integers into an initially empty heap.  Use the property that the root is to be the largest element.  Make sure that you clearly draw all 8 heaps using sequential representation for each heap.  Be complete in your representation giving the index values.                   5      9     13     3     7    15    26    10 

Quicksort performs with complexity Big Oh (n log n) when the list being sorted is in reverse-sorted order.

Consider the heap shown below.  It will be used for Questions #14-16. Give the sequential representation of this heap (uses an array). Be sure to correctly indicate the index positions for each element. 

Show the resulting 7 Red/Black trees that occur when inserting the following keys: T   W   V   Y   M   E   B   For each tree, CLEARLY denote which links are “red”.  Also, clearly denote where splits, single rotations and double rotations occur.  Follow the conventions discussed and demonstrated in class. 

Which of the following terms means hereditary nervous disorder that leads to bizarre, involuntary movements and dementia?

The complexity for the worst case search operation for Red/Black trees is  O (n).

The term radiculitis indicates inflammation of the:

Draw the 2-3-4 trees that results when you insert the keys into an initially empty tree.  Follow the conventions given in lecture.  Draw each intermediate tree making sure that you split the 4-nodes at the proper time!   Also, clearly denote where splits occur.                           I   U   S   B   T   I   T   A   N   P   R   I   

Match each diagnostic abbreviation with the correct definition.