수다닷컴

질문 제목 : 높이 구하는 쪽에서 에러가나요이진트리 높이구하는쪽 해결방법좀요...질문 내용 :
#includestdio.h
#includestdlib.h
typedef struct _node {
int key;
struct _node *left;
struct _node *right;
} node;
node *head, *tail;
int left,right;
void init_tree(void)
{
head = (node*)malloc(sizeof(node));
tail = (node*)malloc(sizeof(node));
head-left = tail;
head-right = tail;
tail-left = tail;
tail-right = tail;
}
node * insert_node(node *t, int tag, int key)
{
node *c = (node *) malloc(sizeof(node));
c-key = key;
c-left = tail;
c-right = tail;
if(tag == left)
{
t-left = c;
}
else t-right = c;
return c;
}
void visit(node *t)
{
printf(%c,t-key);
}
void preorder_traverse(node *t)
{
if(t!=tail)
{
visit(t);
preorder_traverse(t-left);
}
}
void inorder_traverse(node *t)
{
if(t!=tail)
{
inorder_traverse(t-left);
visit(t);
inorder_traverse(t-right);
}
}
void postorder_traverse(node *t)
{
if(t!=tail)
{
postorder_traverse(t-left);
postorder_traverse(t-right);
visit(t);
}
}
int height(node *t)
{
//int height=0;
static int a=0,b=0;
if(t)
{
a= 1+height(t-left);
//b= 1+height(t-right);

if(a=b)
a++;
return a;
//else
//b++;
//return b;
}
return 0;
}

void main()
{
int r;
node *child;init_tree();child=insert_node(head, left, 1);
child=insert_node(head-left,left, 2);
child=insert_node(head-left,right,3);
child=insert_node(child,left, 4);
child=insert_node(child,right,5);
inorder_traverse(head-left);
preorder_traverse(head-left);
postorder_traverse(head-left);
r= height(head-left);
printf(height: %d\n, r);

}

높이구하는쪽에서 오류가 자꾸나네요 여기 어떻게 수정해야하나요

신청하기