E = I + T: The internal extent formula for compacted tries

Details E = I + T: The internal extent formula for compacted tries E = I + T: The internal extent formula for compacted tries

2010-12-14

arxiv.org/abs/1012.3024v1

Computer Science

Data Structures and Algorithms

Scientific paper

It is well known 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.

Affiliated with

Also associated with

No associations

Rating

E = I + T: The internal extent formula for compacted tries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with E = I + T: The internal extent formula for compacted tries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and E = I + T: The internal extent formula for compacted tries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-179641