Quiz: Complexities of data structures

This quiz reviews the complexities of some data structures we have covered. In each case, you should determine if the operation takes (amortized) time O(1), O(log(n)), or O(n) in the size n of the data structure (choose the best possible bound).

Don't memorize the complexities. Instead, remember how each operation works (what makes the data structure "tick"). From this, you can always infer the complexity. And this quiz is just an indirect way for you to confirm that your understanding agrees with ours.