NUIMCrest CS211 - Algorithms and Data Structures II
Department of Computer Science, NUIM
Laboratory Sheet 11

For week beginning Monday 24 April 2000
T Naughton, NUIM
Back to CS211 home

Lab Exam 11

Exam A
Exam B
Exam C
Exam D

When the exam is finished, move on to the lab sheet.

Lab Sheet 11

Read the presentation on AVL trees (it will be handed out again at the next tutorial). AVL trees are an old, but established, method of ensuring worst cost O(log n) searches of an ordered binary tree. You will find further information on the AVL algorithm in any data structures textbook.

End of Lab Sheet