Aurora · Huffman tree generation (segment tree structure non pointer) (imitating adjacency table)

ASRC- Aurora Research Center   Huffman code - Non pointer implementation

Thought reference AcWing In graph theory , about 【 Adjacency list 】 The use of
because 【 Structure priority queue 】 It seems impossible to 【node*】 Sort
This technical difficulty cannot be overcome for the time being , You can only go back and ask for the second place
However, the actual application effect after adjustment is still good
2022-06-22   Hongmeng Era · Heaven and earth Day294

Here is the LR Change to int, use idx As a pointer
The advantage is to avoid node *l,*r Appearance , Can achieve the same effect
The disadvantage is that you need predefined memory , Cannot realize dynamic memory and free
From my practical point of view , In the algorithm competition, the goal is to achieve

Don't go after such details too much
Consider this product optimization in the future engineering practice

Introduction of detailed ideas ： Algorithm design and analysis 2022 · Cloud lab _ Shadow moon, twilight wind blog -CSDN Blog

Result display