《剑指offer》面试题23——从上往下打印二叉树

从上往下打印出二叉树的每个节点，同层节点从左至右打印。

思路：二叉树的层次遍历，借助一个队列实现。

代码：

#include<iostream>
#include <vector>
#include <queue>

using namespace std;

struct  TreeNode {
    int val;
    struct  TreeNode    *left;
    struct  TreeNode    *right;
    TreeNode(int x) :
        val(x), left(NULL), right(NULL) {
    }
};

class BinTree
{
public:
	TreeNode *root;
	TreeNode* CreateTree();
	void preOrder(TreeNode *r);//递归实现先序遍历
	void InOrder(TreeNode *r);//递归实现中序遍历
	void PostOrder(TreeNode *r);//递归实现后续遍历
};
TreeNode* BinTree::CreateTree()//创建一棵二叉树
{
	TreeNode *p1=new TreeNode(1);
	TreeNode *p2=new TreeNode(2);
	TreeNode *p3=new TreeNode(3);
	TreeNode *p4=new TreeNode(4);
	TreeNode *p5=new TreeNode(5);
	TreeNode *p6=new TreeNode(6);
	TreeNode *p7=new TreeNode(7);
	TreeNode *p8=new TreeNode(8);
	TreeNode *p9=new TreeNode(9);
	p1->left=p2;
	p1->right=p3;
	p2->left=p4;
	p2->right=p5;
	p5->left=p6;
	p3->left=p7;
	p3->right=p8;
	p8->right=p9;
	root=p1;
	return root;
}


void Print(vector<int> &myarray)
{
    int num=myarray.size();
    for(int i=0; i<num;i++)
         cout<<myarray[i]<<"  ";
    cout<<endl;
    return;
}
vector<int> PrintFromTopToBottom(TreeNode* root)
{
        vector<int> res;
        if(root==NULL)
            return res;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty())
            {
                res.push_back(q.front()->val);
                if(q.front()->left!=NULL)
                    q.push(q.front()->left);
                if(q.front()->right!=NULL)
                    q.push(q.front()->right);
                q.pop();
            }
            return res;
}

int main()
{

        BinTree t;
	    TreeNode* root=t.CreateTree();//创建二叉树

       vector<int>vec= PrintFromTopToBottom( root );

        Print(vec);

        return 0;
}

运行结果：

1  2  3  4  5  7  8  6  9

Process returned 0 (0x0)   execution time : 0.272 s
Press any key to continue.