class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> v;
if(root==nullptr)
return v;
stack<TreeNode*>s;
s.push(root);
while(!s.empty())
{
root=s.top();
v.push_back(root->val);
s.pop();
if(root->right)
s.push(root->right);
if(root->left)
s.push(root->left);
}
return v;
}
};
二叉树的前序非递归遍历
最新推荐文章于 2023-06-27 10:46:10 发布