Two-dimensional Range Tree

A two-dimensional range-tree is similar to a 1D-tree, except that the odd levels of the tree represent divisions in the vertical coordinate, and the even levels of the tree in the horizontal coordinate.  A range tree differs from a two-dimensional tree (two-dimensional kd-tree) in that the data determine the bifurcations (bifurcations occur at the median of the range). Except for alternating in the treatment of the two coordinates, a 2D-tree is constructed in the same way as a 1D-tree.

This work was done by Lindsay Hilbert, F&M '04.

Movies

Twelve movies are available:  for eight points (seven movies, two with pauses for the viewer to receive and answer questions), and sixteen points (five movies.  Remember the guidelines for use of these movies.