Trie Index Properties

Shape only depends on key space and lengths.

• Does not depend on existing keys or insertion order.

• Does not reuire rebalancing operations

All operations have O(k) Complexity where k is the length of the key.

• The path to a leaf node represents the key of the leaf

• Keys are stored implicitly and can be reconstructed from paths.