16 October 2007
Digital trees is a general structure to manipulate sequences of characters. We propose a novel approach to the structure of digital trees. It shades some new light on the profile of digital trees, and provides a unified explanation of the relationships between different kinds of digital trees. The idea relies on the distinction of nodes based on their type, i.e., the set of their children. Only two types happen to matter when studying the number of nodes lying at a specified level: the nodes with a full set of children which constitutes the core, and the nodes with a single child producing spaghetti-like trees hanging down the core. We will explain the distinction and its applications on a number of examples related to data structures such as the TST of Bentley and Sedgewick. This is joint work with Luc Devroye.
- Combinatorial Theory Seminar