E = I + T：压缩尝试的内部范围公式
E = I + T: The internal extent formula for compacted tries
摘要：
众所周知，在二叉树中，外部路径长度减去内部路径长度正好是2n-2，其中n是外部节点的数量。我们发现，一个概括的公式持有紧凑的尝试，取代的作用的路径的概念的程度，和值2n-2的trie测度，估计的位数是必要的，以描述的trie。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
