850 likes | 860 Vues
Learn about the definitions and operations of trees, including AVL trees, binary search trees, splay trees, and optimal binary search trees. Discover pseudocode examples and the concept of amortized running time. Get ready for the upcoming test and participate actively in the course.
E N D
Topic 10 Trees
Traversal • Operations tree
Announcements • Participation 4 is up • Homework 3 grading • Homework 4 grading
Deletion • Need • Min/max • Successor/predecessor
Announcements • Test in 2 weeks • Participation due tomorrow • Clarification
Amortized Running Time • Runtime:
More Notation • (i,j) • (j+1, j)