typedef struct binode {char data; struct binode *lchild, *rchild;}binode, *bitree; //二.叉链表树的结点类型定义 void vst(bitree bt) //bt为根结点指针 { bitree p; p=bt; initstack(s); //初始化栈s为空栈 while (pll !empty(s)) //栈s不为空 if(p) {push(s,p);1 } else {p=pop(s); printf(%c",p->data);2;} } int depth(bitree bt) { int hl, hr; if(bt=NULL) return3 hl=depth(bt->lchild); hr=depth(bt->rchild); if4 5 return(hr+1); }