|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Descriptor for level-order traversal information. More...
#include <huffman_btreepic.H>
Public Member Functions | |
| Level_Desc ()=default | |
| Default constructor. | |
| Level_Desc (bool il, Freq_Node *succ=nullptr) | |
| Construct with child direction and optional successor. | |
Public Attributes | |
| bool | is_left = false |
| True if this node is a left child. | |
| Freq_Node * | level_succ = nullptr |
| Next node in level-order traversal. | |
Descriptor for level-order traversal information.
Stores whether a node is a left or right child and its successor in level-order traversal. This information is used to detect potentially overlapping labels that need adjustment.
Definition at line 145 of file huffman_btreepic.H.
|
default |
Default constructor.
Construct with child direction and optional successor.
| il | True if left child |
| succ | Successor in level-order (optional) |
Definition at line 158 of file huffman_btreepic.H.
True if this node is a left child.
Definition at line 147 of file huffman_btreepic.H.
Next node in level-order traversal.
Definition at line 148 of file huffman_btreepic.H.