2021-Postgraduate-408/DailySummary/非递归求二叉树高度.cpp

int BtDepth(BiTree T){
	if(!T) return 0;
	int front = -1, rear = -1;
	int last = 0, level = 0;
	BiTree Q[maxSize];
	Q[++rear] = T;
	BiTree p;
	while(front < rear){
		p = Q[++front];
		if(p->lchild)
			Q[++rear] = p->lchild;
		if(p->rchild)
			Q[++rear] = p->rchild;
		if(front == last){
			level++;
			last = rear;
		}
	}
	return level;
}