One-dimensional search tree
A search tree is a hierarchical data structure containing data; the tree is built using the ordering property of the data, such that anything to the right is "greater" than anything to its left. For a one-dimensional search tree, we construct a binary tree with the ordering property, and then use it to find all data on a one-dimensional range.
This work was done by Anton Weber, University of Innsbruck (Austria), 2003-04.
Movies
Thirteen movies are available: for eight points (three movies), sixteen points (three movies, thirty-two points (four movies, including one with pauses to pose questions to the viewer), and 64 points (three movies). Remember the guidelines for use of these movies.
