(data structure)
Definition: A full binary tree that represents a coding, such as produced by Huffman coding. Each leaf is an encoded symbol. The path from the root to a leaf is its codeword.
Generalization (I am a kind of ...)
full binary tree, trie.
Aggregate parent (I am a part of or used in ...)
Huffman coding.
See also prefix code.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 30 April 2007.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "coding tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 30 April 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/codingTree.html
