408/2021-Postgraduate-408
1
0
Fork 0
mirror of https://github.com/hao14293/2021-Postgraduate-408.git synced 2026-02-02 18:20:30 +08:00
Code Issues Projects Releases Wiki Activity

Create 非递归求二叉树高度.cpp

Browse Source
This commit is contained in:
hao14293
2019-07-25 15:51:32 +08:00
committed by GitHub
parent 40a6d8bf55
commit b0917712fc
1 changed files with 22 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
DailySummary/非递归求二叉树高度.cpp Normal file
View File

@@ -0,0 +1,22 @@
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;
}