class Solution {
public:
vector<int> preorderTraversal(TreeNode* root)
{
stack<TreeNode*> stack_;
TreeNode* cur =root;
vector<int> ret;
while(cur||!stack_.empty())
{
while(cur)
{
stack_.push(cur);
ret.push_back(cur->val);
cur = cur->left;
}
TreeNode* top = stack_.top();
stack_.pop();
cur = top->right;
}
return ret;
}
};
leetcode 144. 二叉树的前序遍历
最新推荐文章于 2024-07-25 11:15:54 发布