按层访问二叉树

#include <iostream>

#include<queue>

using namespace std;


typedef struct tag_TreeNode{
    int val;
    struct tag_TreeNode* left;
    struct tag_TreeNode* right;

    tag_TreeNode(int val) : val(val)
    {
        left = NULL;
        right = NULL;
    }

    tag_TreeNode() {}
}TreeNode;
typedef TreeNode* TreeNodePtr;

TreeNodePtr g_TreeRoot;        // 根节点

void InitTree();
TreeNodePtr InitTreeNode(int val);

void InitTree()
{
    g_TreeRoot = InitTreeNode(0);

    g_TreeRoot->left = InitTreeNode(1);
    g_TreeRoot->right = InitTreeNode(2);

    g_TreeRoot->left->left = InitTreeNode(3);
    g_TreeRoot->left->right = InitTreeNode(4);
    g_TreeRoot->right->left = InitTreeNode(5);
    g_TreeRoot->right->right = InitTreeNode(6);

    g_TreeRoot->left->left->left = InitTreeNode(7);
    g_TreeRoot->left->left->right = InitTreeNode(8);
    g_TreeRoot->left->right->left = InitTreeNode(9);
    g_TreeRoot->left->right->right = InitTreeNode(10);

    g_TreeRoot->right->left->left = InitTreeNode(11);
    g_TreeRoot->right->left->right = InitTreeNode(12);
    g_TreeRoot->right->right->left = InitTreeNode(13);
    g_TreeRoot->right->right->right = InitTreeNode(14);

}

TreeNodePtr InitTreeNode(int val)
{
    TreeNodePtr node_ptr = new TreeNode(val);
    if (NULL == node_ptr)
    {
        return NULL;
    }

    return node_ptr;
}

void printFront(TreeNodePtr root)
{
    queue<TreeNodePtr> q;
    q.push(root);

    while(!q.empty())
    {
        TreeNodePtr tmp = q.front();
        cout << tmp->val << endl;
        q.pop();
        if(tmp->left)
            q.push(tmp->left);
        if (tmp->right)
            q.push(tmp->right);
    }
}

int main(int argc, const char **argv)
{
    InitTree();

    printFront(g_TreeRoot);

    return 0;
}