思路:首先从头结点开始,因为一层一层的读取,每读一个节点时,要记录其左右子节点,下一个读取的为其左子节点,然后再次读取其右子节点,所以要存入一个队列依次,然后每次从队列头去节点读取值
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 *node=que.front();
if(node->left!=NULL)
que.push(node->left);
if(node->right!=NULL)
que.push(node->right);
res.push_back(node->val);
que.pop();
}
return res;
}
};