从上往下打印二叉树

题目：从上往下打印二叉树

题目描述

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

思路

层次遍历二叉树，用队列

class Solution {
public:
    vector<int> PrintFromTopToBottom(TreeNode* root) {
        vector<int> res;
		if(root == NULL) return res;
		queue<TreeNode *> q;
		q.push(root);
		while(q.size()>0){
			int size = q.size();
			while(size){
				TreeNode *now = q.front();
				res.push_back(now->val);
				if(now->left)
					q.push(now->left);
				if(now->right)
					q.push(now->right);
				q.pop();
				size--;
			}
		}
		return res;
    }
};