Balanced Binary Search Trees

Reading

• AVL tree.
• Red-Black tree.

Exercise

• Source codes.
• Unit tests.

Quiz

• Explain how the remove method works in AbstractBalancedBinarySearchTree:
• Explain what gets assigned to lowest in line 43.
• Explain how the balance method in AVLTree and RedBlackTree keeps the tree in balance (or not in balance) after a removal.
• Write a report about your explanation and save it as quiz4.pdf.
• Submit quiz4.pdf: https://canvas.emory.edu/courses/32845/assignments/79350