6.851 Advanced Data Structures (Spring'12) Prof. Erik Demaine Problem 2 Due: Thursday, Mar. 1
6.851 Advanced Data Structures (Spring'12) Prof. Erik Demaine Problem 2 Due: Thursday, Mar. 1
Be sure to read the instructions on the assignments section of the class web page. Range tree construction. Recall that in class we presented the range tree and the layered range tree for answering orthogonal range trees. However, we did not describe how to construct them eciently. 1. Describe how to construct a d-dimensional range tree on n given points in O(n lgd1 n) time. 2. Describe how to construct a d-dimensional layered range tree on n given points in O(n lgd1 n) time.
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.