/**
* 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) {
vector<int> res;
if(!root){
return res;
}
stack<TreeNode*>stk;
TreeNode* node=root;
while(node!=nullptr || !stk.empty()){
while(node!=nullptr){
res.emplace_back(node->val);
stk.emplace(node);
node=node->left;
}
node=stk.top();
stk.pop();
node=node->right;
}
return res;
}
};
二叉树前序遍历迭代
最新推荐文章于 2024-07-08 22:12:26 发布