Next: , Up: Critical Bit Tree String Key Pointer Value Arrays   [Index]


4.1.3.1 Critical Bit Tree Associative Array

The critical bit tree associative array selects nodes with 1 bit. The tree is path compressed, it is not prefix compressed.

The tree is a binary tree, storing information in leaves only. All internal nodes have two children. For N items there exist N leaf nodes and N - 1 internal nodes.

General library:

See String Key Pointer Value Array Library.


Next: , Up: Critical Bit Tree String Key Pointer Value Arrays   [Index]