Today’s Agenda
•
Continue Discussing Trees
•
Examine the algorithm to insert
•
Examine the algorithm to remove
•
Begin discussing efficiency of tree
•
Are there any alternatives?
–
2-3
–
2-3-4 (next time)
–
red-black trees (next time)
–
AVL (next time)
•
