BSP Acquisition
Must construct a “good” binary search structure
Efficiency comes from logarithmic tree depth
“Bad”
“Good”
Naylor
Previous slide
Next slide
Back to first slide
View graphic version