MA 2733 Midterm: MATH 2733 MSState OES F12 3
Document Summary
Don"t panic: (10 pts) in the boxes below, show the avl trees that result from the successive addition of the given values. Name ____________________________: (10 pts) in the boxes below, show the red-black trees that result from the successive additions of the given values. Name ____________________________: (10 pts) draw the b-trees that result when adding the following values in succession, starting with an empty tree. Assume each node can only hold 2 keys. To save drawing time, you can choose to draw a new tree only when a split occurs, but make it clear which value caused the split. Name ____________________________: (10 pts total) a) assume a 10-element hashtable, with hash(x) = x mod 10 and linear probing. Show what locations would be probed, in order, for each value in the table, and put the value in its final resting place, if any, in the array:
