求二叉树第一条最长路径的长度并输出其节点信息,只修改lujing和long两...答:/* 显示哈夫曼树 */ void DisplayHuffmanTree(HuffmanTree HT,int n){int i;for(i=1;i<=2*n-1;i++)if (i<=n)printf("\n%4d,%4c,%5d,%5d,%5d,%5d",i,HT[i].letter,HT[i].weight,HT[i].parent,HT[i].lchild,HT[i].rchild);else printf("\n%4d,%4c,%5d,%5d,%5d,%...