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
- Fall '10
- Data Structures, Prof. Erik Demaine, Dr. Andr´ Schulz