二叉树基本操作及其他2

int heigh(BTree* tree)//树高
{
if (tree == NULL)
return FALSE;

int ret = r_heigh(tree->root);
return ret;
}


int  r_heigh(BTreeNode* node)
{
if (node == NULL)
return FALSE;

int lh = r_height (node->lchild);
int rh = r_height (node->rchild);

return (lh > rh ? lh+1 : rh+1);
}





int bianli(BTree* tree)//遍历操作
{
if (tree == NULL)
return FALSE;

pre(tree->root);
mid(tree->root);
last(tree->root);

return TRUE;
}
int pre(BTreeNode* node)//前序遍历
{
if (node == NULL)
return FALSE;

printf ("%c",node->data);
pre (node->lchild);
pre (node->rchild);//两步递归操作
}


int mid(BTreeNode* node)//中序遍历
{
if (node == NULL)
return FALSE;

mid(node->lchild);
printf("%c",node->data);
mid(node->rchild);

return TRUE;
}


int last(BTreeNode* node)//后序遍历
{
if (node == NULL)
return FALSE;

last(node->lchild);
last(node->rchild);
printf("%c",node->data);

return TRUE;
}