/Huffman-binary-tree-script

Preorder traversal binary tree example based on HUFFVAL table with C++

Primary LanguageC++

Console output
(Created) Value: 1, Code: 00
(Created) Value: 2, Code: 010
(Created) Value: 3, Code: 011
(Created) Value: 4, Code: 1000
(Deleted) Value: 1, Code: 00
(Deleted) Value: 2, Code: 010
(Deleted) Value: 3, Code: 011
(Deleted) Value: 0, Code: 01
(Deleted) Value: 0, Code: 0
(Deleted) Value: 4, Code: 1000
(Deleted) Value: 0, Code: 100
(Deleted) Value: 0, Code: 10
(Deleted) Value: 0, Code: 1
(Deleted) Value: 0, Code:

Context
9 total nodes: 4 roots and 5 "empty" nodes (value 0 by default). Based on HUFFVAL table with 4 total values: 1 value of 2 bits length, 2 values of 3 bits length and 1 value of 4 bits length. Roots correspond to values in the HUFFVAL table. Nodes added via preorder traversal, removed via postorder traversal.

Example Huffman binary tree visualization