判断是否为满二叉树

#include<stdio.h> #include<stdlib.h> typedef struct BiTNode{ char data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; int Full(BiTree &bt){ //判断是否为满二叉树 if(bt){ if(bt->lchild==NULL&&bt->rch

>>阅读原文<<