【剑指Offer】从上往下打印二叉树

• 题目：

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

• 代码：

/*
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> a;
        if(!root){
            return a;
         }
         deque<TreeNode *> dequeTreeNode;
         dequeTreeNode.push_back(root);
         while(dequeTreeNode.size()){
             TreeNode *pNode=dequeTreeNode.front();
             dequeTreeNode.pop_front();
             a.push_back(pNode->val);
             if(pNode->left)
                 dequeTreeNode.push_back(pNode->left);
             if(pNode->right)
                 dequeTreeNode.push_back(pNode->right);
         }
         return a;
    }
};

• 总结：
  关键是从题目中分析，通过模拟具体的过程，能够想到用队列实现。