This preview shows page 1. Sign up to view the full content.
Unformatted text preview: k k matrix of entries, in column-major order, when the items are stored in row-major order.) Logarithmic redux. Give a purely geometric argument that there is a binary search tree sup-porting any m searches on n items in O ( m log n ) total time. (Reason about point sets, not binary search trees.) 1...
View Full Document
This note was uploaded on 01/20/2012 for the course CS 6.849 taught by Professor Erikdemaine during the Fall '10 term at MIT.
- Fall '10
- Data Structures