First Extra Credit Quiz
CS 225 Data Structures and Software Principles
Fall 2007
Friday, October 26
Name:
NetID:
Lab Section (Day/Time):
1. [Multiple Choice Questions – 5 points].
MC1 (1pt)
In an n node AVL tree, the insertion and removal operations require how many rotations to
rebalance the tree in the worst case?
(a) O(log n) for both
(b) O(log n) for insertion and O(n) for removal
(c) O(log n) for insertion and exactly 1 rotation for removal
(d) O(1) for insertion and O(log n) for removal
MC2 (1pt)
A non-root internal node in an order mB-tree has how many children?
(a) m
(b) m−1
(c) between ⌈m
2⌉and m
(d) between 2 and m
MC3 (1pt)
True or False: An AVL Tree is a minimal height Binary Search Tree.
(a) True
(b) False
MC4 (1pt)
A right-left rotation is used to rebalance the following AVL tree. Four potential solutions are
shown below. Which solution acurately portrays the result of applying the right-left rotation to
node M?
