1. A digital tree data structure storing indexes stored in a computer memory, comprising: a branch node including a plurality of rich pointers referencing respective subexpanses, at least one of said subexpanses being fully populated with a plurality of said indexes and a corresponding one of said rich pointers associated with said fully populated subexpanse including an indication that said subexpanse is full.