COSC 2011 Section N
Tuesday, April 17 2001
This lecture will cover Binary Search Trees and AVL Trees. AVL trees will also be discussed in Thursdays lecture. Although Hashing was introduced in last Thursday's lecture, we will not continue with Hashing this week and may (time permitting) return to Hashing at a later date.
Here are the sections of the textbook:
Pages | Section |
256 - 259 | 7.3 |
260 - 270 | 7.4 |
Pages | Section |
380 - 387 | 9.1 |
393 - 403 | 9.2 |
Additional Material: