Averest


BinCodeTree Type

Prefix codes are represented as binary trees whose leafs are the symbols that were encoded. The codes correspond with the paths from the root to the character where left/right branchings correspond with bits 0 and 1, respectively.

Union cases

Union case Description

Leaf char

Full Usage: Leaf char

Parameters:
    Item : char

Item : char
Item : BinCodeTree * BinCodeTree