본문내용
void maketree(){
Type* tem = (Type *)malloc(sizeof(Type));
Type* a;
Type* b;
a = head;
b = head->next;
tem->value = a->value + b->value;
tem->lchild = a;
tem->rchild = b;
head = tem;
tem->next = b->next;
Type* tem = (Type *)malloc(sizeof(Type));
Type* a;
Type* b;
a = head;
b = head->next;
tem->value = a->value + b->value;
tem->lchild = a;
tem->rchild = b;
head = tem;
tem->next = b->next;