剑指Offer 从上到下打印二叉树

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

解析：通过队列即可轻松实现bfs，即对应的层次遍历

牛客网AC代码: 

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    vector<int> PrintFromTopToBottom(TreeNode* root) {
        vector<int> res;
        if(root == nullptr)
            return res;
        queue<TreeNode *> que;
        que.push(root);
        while(!que.empty()){
            TreeNode *cur = que.front();
            res.push_back(cur->val);
            que.pop();
            if(cur->left != nullptr)
                que.push(cur->left);
            if(cur->right != nullptr)
                que.push(cur->right);
        }
        return res;
    }
};