0% found this document useful (0 votes)
33 views

6.851 Advanced Data Structures (Spring'12) Prof. Erik Demaine Problem 2 Due: Thursday, Mar. 1

This document provides instructions for problem 2 of the 6.851 Advanced Data Structures course assignment due on March 1st, 2012. It asks students to describe how to efficiently construct a d-dimensional range tree and a d-dimensional layered range tree on n given points, both in O(n lgd−1 n) time.

Uploaded by

djoseph_1
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
33 views

6.851 Advanced Data Structures (Spring'12) Prof. Erik Demaine Problem 2 Due: Thursday, Mar. 1

This document provides instructions for problem 2 of the 6.851 Advanced Data Structures course assignment due on March 1st, 2012. It asks students to describe how to efficiently construct a d-dimensional range tree and a d-dimensional layered range tree on n given points, both in O(n lgd−1 n) time.

Uploaded by

djoseph_1
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

6.851 Advanced Data Structures (Spring12) Prof. Erik Demaine Problem 2 Due: Thursday, Mar.

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.

MIT OpenCourseWare http://ocw.mit.edu

6.851 Advanced Data Structures


Spring 2012

For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

You might also like