Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Level_Desc Struct Reference

Descriptor for level-order traversal information. More...

#include <huffman_btreepic.H>

Collaboration diagram for Level_Desc:
[legend]

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_Nodelevel_succ = nullptr
 Next node in level-order traversal.
 

Detailed Description

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.

Constructor & Destructor Documentation

◆ Level_Desc() [1/2]

Level_Desc::Level_Desc ( )
default

Default constructor.

◆ Level_Desc() [2/2]

Level_Desc::Level_Desc ( bool  il,
Freq_Node succ = nullptr 
)
inline

Construct with child direction and optional successor.

Parameters
ilTrue if left child
succSuccessor in level-order (optional)

Definition at line 158 of file huffman_btreepic.H.

Member Data Documentation

◆ is_left

bool Level_Desc::is_left = false

True if this node is a left child.

Definition at line 147 of file huffman_btreepic.H.

◆ level_succ

Freq_Node* Level_Desc::level_succ = nullptr

Next node in level-order traversal.

Definition at line 148 of file huffman_btreepic.H.


The documentation for this struct was generated from the following file: