二叉树层次遍历C++实现

// Type your C++ code and click the "Run Code" button!
// Your code output will be shown on the left.
// Click on the "Show input" button to enter input data to be read (from stdin).
 
#include <iostream>
#include <queue>
using namespace std;
 
typedef struct Node {
    int data;
    struct Node *lchild;
    struct Node *rchild;
} TNode;
 
typedef TNode * BinTree;
 
void layer_traver(BinTree BT){
     queue<BinTree> q;
     BinTree p=BT;
     if(p!=NULL){
         q.push(p);
     }
     while(!q.empty()){
         p = q.front();
         q.pop();
         cout<<p->data<<endl;
         if(p->lchild!=NULL) 
            q.push(p->lchild);
         if(p->rchild!=NULL){ 
            q.push(p->rchild);
         } 
     } 
 }
 
int main() {
    
    TNode rl = {data:2, lchild:NULL, rchild:NULL};
    TNode rr = {data:3, lchild:NULL, rchild:NULL};
    TNode root = {data:1, lchild:&rl, rchild:&rr};
    
    layer_traver(&root);
    
    return 0;
}

 

欢迎关注微信公众号——计算机视觉：