Location of Repository

It is well known [Knu97, pages 399–400] that in a binary tree the external path length minus the internal path length is exactly 2n 2, where n is the number of external nodes. We show that a generalization of the formula holds for compacted tries, replacing the role of paths with the notion of extent, and the value 2n 2 with the trie measure, an estimation of the number of bits that are necessary to describe the trie

Year: 2011

OAI identifier:
oai:CiteSeerX.psu:10.1.1.187.1858

Provided by:
CiteSeerX

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.