October 28

• Continue
• Begin Trees, Part II.
• Re-balancing an AVL tree after insertion: left rotations, right rotations, double left and double right rotations.
• AVL tree complexity analysis: $N_h$ is the minimum number of nodes in an AVL tree of height $h$ -- use Fibonacci sequence.
• Heaps: definitions of heap order and heap shape property