哈夫曼编码

const int len = 5; struct Node { int tag; int data; Node* left; Node* right; Node* parent; int code; }; int main() { Node* child[2]; int data[] = {1,2,3,4,5}; Node* a = new Node[2 * len - 1]; for (int i = 0; i < len; i++) { a[i].data = data[i]; a[i].tag = 0; a[i].left = nullptr; a[i].right = nullptr; a[i].parent = nullptr; a[i].code = 0; } for (int i = len + 1; i < (2 * len - 1); i++) { a[i].data = 0; a [i].tag = 0; a[i].left = nullptr; a[i].right = nullptr; a[i].parent = nullptr; a[i].code = 0; } ...