宽度优先搜索

完成对一个树的宽度优先搜索
话不多说直接贴代码

/*
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;
        queue<TreeNode *> q;
        TreeNode *tmp=root;
        if(root!=NULL){ 
            q.push(tmp);
             while(q.empty()==false){
                    tmp=q.front();
                    q.pop();
                    res.push_back(tmp->val);
                    if(tmp->left!=NULL) q.push(tmp->left);
                    if(tmp->right!=NULL) q.push(tmp->right);    
                   }
          }          
         return res;
        }
};