Suppose that you are inserting a new key into a 2-3 tree. Under which one of the following scenarios must the height of the 2-3 tree increase by one?

Suppose that you left rotate the node containing E in the BST below. What is the level-order traversal of the resulting red-black BST?

Suppose that you insert N keys in ascending order into a red-black BST. What is the height of the resulting tree?

How many probes does a search in a B-tree of order M with N keys require in the worst case?