coding tree

(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

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 30 April 2007.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "coding tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 30 April 2007. (accessed TODAY) Available from: