Data Structure Tree exercises (4)

 

A binary tree is represented by a binary linked list to determine the number of leaf nodes on a layer K.

Basic Idea: uses the queue structure to traverse layers, and records the number of leaf nodes when traversing the K-layer.

Code:

 

Int leafklevel (bitree BT, int K) {If (bt = NULL | K <1) {return 0;} bitree P = BT, Q []; int front = 0, rear = 1, leaf = 0; int last = 1, level = 1; Q [1] = P; while (front <= rear) {P = Q [++ front]; If (Level = K &&! P-> lchild &&! P-> rchild) {leaf ++;} If (p-> lchild) {q [++ rear] = p-> lchild;} If (p-> rchild) {q [++ rear] = p-> rchild;} If (front = last) {level ++; last = rear;} If (level> K) {return leaf ;}}}