题目描述:从上往下打印出二叉树的每个节点,同层节点从左至右打印。
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) {
queue<TreeNode *> dequeTreeNode;
vector<int> result;
if(root == NULL)
return;
dequeTreeNode.push(root);
while(dequeTreeNode.size()){
TreeNode* pNode = dequeTreeNode.front();
dequeTreeNode.pop();
result.push_back(p->val);
if(pNode->left != NULL)
dequeTreeNode.push(pNode->lef);
if(pNode->right != NULL)
dequeTreeNode.push(pNode->right);
}
return result;
}
};