树的深度、顺序输出树

#include <stdio.h> #include <stdlib.h> #include <queue> using namespace std; typedef struct BiTNode{ int value; struct BiTNode *lchild; struct BiTNode *rchild; }BiTNode,*BiTree; BiTree reb

>>阅读原文<<