1、题目
给你二叉树的根节点 root ,返回它节点值的 前序 遍历。
链接:https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
2、思路分析
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
stack<TreeNode*> s;
TreeNode* cur = root;
vector<int> res;
while(!s.empty() || cur != nullptr)
{
while(cur != nullptr){
s.push(cur);
res.push_back(cur->val);
cur = cur->left;
}
cur = s.top();
s.pop();
cur = cur->right;
}
return res;
}
};