Question

根据集合（3,6,11,9,5,15,18）构造哈夫曼树的带权路径长度!

Answer 1

#define n 7

typedef

struct node

{

int data,lchild,parent,rchild;

}tree;

int s[]={3,6,11,9,5,15,18};

void creat(tree h[])

{ int i,k,min1,min2,p1,p2;

for(i=1;i