Lecture 16

Learning objectives

After this class, you should be able to:

1. Explain the derivation of the average case time complexity for searching and insertion into a binary search tree.
2. Use integration to estimate sums.

Reading assignment

1. Section 4.3.6, see pages 288-289 (average case analysis) for additional information.
2. Lecture: Trees: Part 3 -- Binary search trees.
3. None. Prepare for the midterm.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Use integration to estimate the sum of the first N positive integers.
  2. Use integration to estimate the sum of the squares of the first N positive integers.

• Questions on next lecture's material
  1. None.