下面的这段代码什么意思，帮忙看一下，谢谢！！！

Question

 void BianMa(MyTreeNode* mtns[]) {  
    MyTreeNode* curr;
    string codes;
    char* code = new char[size];
    for (int i = 0; i < size; i++) {
        code[i] = '2';
    }
    for (int i = 0; i < size; i++) {
        int j = 1;
        cout<<mtns[i]->data<<"的哈弗曼编码为：";
        curr = mtns[i];     
        while (curr->isfather == true) {
            curr = curr->father;
            if (curr->isfather == true){
                code[j++] = curr->code;
            }
        }
        code[0] = mtns[i]->code;
        //cout<<mtns[i]->code<<endl;
        /*for (int k = j-1; k >= 0; k--) {
            if (code[k] != '2'){
                cout<<code[k]<<" "; 
            }
        }*/
        char c[j];
        //cout<<endl<<j<<endl;
        int count = 0;
        for (int l = j-1; l >=0; l--) {
            if (code[l] != '2') {
                c[count++] = code[l];
                //cout<<code[l]<<endl;
            }
        }
        for (int x = 0; x < j; x++) {
            mtns[i]->codes += c[x];
        }
        cout<<mtns[i]->codes<<endl;
        cout<<endl;
    }   
}

帮忙解释一下这段代码什么意思，请大家帮帮忙，谢谢，感激不尽！！！！

Answer 1

 根据哈夫曼树生成哈夫曼编码。给定字符集的哈夫曼树生成后，求哈夫曼编码的具体实现过程是：依次以叶子T[i](0≤i≤n-1)为出发点，向上回溯至根为止。上溯时走左分支则生成代码0，走右分支则生成代码1。