求二叉树深度叶子结点数总结点数.docVIP

#includemalloc.h #define NULL 0 #includestdio.h typedef struct node { char data; struct node *lchild,*rchild; }NODE; int count; NODE *crt_bt_pre()/*二叉树先序创建算法*/ { NODE * bt; char ch; printf(\n\t\t\t); scanf(%c,ch); getchar(); if(ch== ) bt=NULL; else { bt=(NODE*)malloc(sizeof(NODE)); bt-data=ch; printf(\n\t\t\t请输入%c结点的左孩子:,bt-data); bt-lchild=crt_bt_pre(); printf(\n\t\t\t请输入%c结点的右孩子:,bt-data); bt-rchild=crt_bt_pre(); } return(bt); } void Preorder(NODE* bt)/*二叉树先序递归遍历算法*/ { if(bt!=NULL) { printf(\n\t\t\t %c,bt-data);