By the end of this module, you should be able to:
- list some properties that guarantee that a tree will be balanced
- explain how to dynamically maintain these properties
in a tree under insertion and deletion
- explain how to do a rotation operation on a tree and why it is
important for rebalancing
- perform insertion and deletion in an AVL tree
- perform insertion in a 234 tree