BinCodeTree (Averest)

BinCodeTree Type

Namespace: Averest.TeachingTools
Assembly: Averest.dll
Parent Module: Encodings
Base Type: obj
All Interfaces: IEquatable<BinCodeTree> , IStructuralEquatable , IComparable<BinCodeTree> , IComparable , IStructuralComparable

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`
`Node BinCodeTree * BinCodeTree` Full Usage: `Node BinCodeTree * BinCodeTree` Parameters: Item : `BinCodeTree * BinCodeTree`	Item : `BinCodeTree * BinCodeTree`

Instance members

Instance member	Description
`this.IsLeaf` Full Usage: `this.IsLeaf` Returns: `bool`	Returns: `bool`
`this.IsNode` Full Usage: `this.IsNode` Returns: `bool`	Returns: `bool`