6-8 求二叉树高度 (20 分)
int GetHeight( BinTree BT ){
int ldepth,rdepth;
if(BT==NULL)
return 0;
else{
ldepth=GetHeight(BT->Left);
rdepth=GetHeight(BT->Right);
if(ldepth>rdepth)
return ldepth+1;
else
return rdepth+1;
}
}
6-9 二叉树的遍历 (25 分)
void InorderTraversal(BinTree BT ){
if(BT==NULL)
//不要忘记return
return;
InorderTraversal(BT->Left);
printf(" %c",BT->Data);
InorderTraversal(BT->Right);
}
void PreorderTraversal( BinTree BT ){
if(BT==NULL)
//不要忘记return
return;
printf(" %c",BT->Data);
PreorderTraversal(BT->Left);
PreorderTraversal(BT->Right);
}
void PostorderTraversal( BinTree BT ){
if(BT==NULL)
//不要忘记return
return;
PostorderTraversal