Module 5:
slide 31: shouldn't insert and delete be O(n) since you have to shift elements?
slide 37: how can you implement MTF with array? Doesn't it need O(n) to shift?
Also, what does optimal "offline" ordering mean?

module 4 slide 26:
"suffices to store height right - height left" - but then how do you modify the rebalancing algorithms for that? Can't tell what the current balance factor is from the balance factor of the children

When removing a node from an AVL tree, the overall height of the tree may not change or may decrease by 1. Is it possible that the height decreases by 2 or more?

Remember that when deleting from AVL, if the two children of the taller child of the unbalanced node are the same height, you cannot just randomly choose one. Refer to Olga's slides for more info.


SKIP LIST:
The expected number of steps to go up k levels is 2k. But, how can we then conclude that k is in O(log n)?