class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;
stack<TreeNode*> treeStack;
if (!root) {
return {};
}
treeStack.push(root);
while (!treeStack.empty()) {
TreeNode* tempNode = treeStack.top();
treeStack.pop();
if (tempNode -> right) {
treeStack.push(tempNode -> right);
}
if (tempNode -> left) {
treeStack.push(tempNode -> left);
}
result.push_back(tempNode -> val);
}
return result;
}
};
二叉树1 前序遍历(迭代法) 冲
最新推荐文章于 2023-05-23 08:30:10 发布