6.851 Advanced Data Structures (Spring’10)Prof. Erik DemaineDr. Andr´e SchulzTA: Aleksandar ZlateskiProblem 6Due: Thursday, Mar. 18Be sure to read the instructions on the assignments section of the class web page.Dynamizing static search structures.Anexponential search treeonnkeys is a search treedata structure where the root has Θ(n1/c) children, for a constantc >1, and each child subtreeis an exponential search tree on Θ(n1-1/c) keys. The actual data is stored at the leaves. Internalnodes store “splitters”, which are or were keys, to enable search. Namely, an internal node stores asplitter for each child that is less than or equal to all nodes in the child subtree, and greater thanall nodes in its left sibling subtree. For example, the splitter for a child could be the smallest keyin the child subtree. (Assume for simplicity that all keys are distinct.) The internal node storesthese splitters in a specified static predecessor search data structure (such as fusion trees).
This is the end of the preview.
access the rest of the document.