判斷是否爲滿二叉樹

#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

>>阅读原文<<