题目:
一刷在这里:
(含morris遍历)代码随想录 Leetcode144/94/145 二叉树的前/中/后序遍历-CSDN博客
代码(二刷自解 2024年3月5日):
/**
* 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://中序: 中 左 右
void recursionMid(TreeNode* root, vector<int>& a) {
if (!root) return;
recursionMid(root->left, a);
a.emplace_back(root->val);
recursionMid(root->right, a);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;
recursionMid(root, result);
return result;
}
};
代码(二刷看解析 迭代遍历 2024年3月5日)
/**
* 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> inorderTraversal(TreeNode* root) {
vector<int> result;
stack<TreeNode*> mystack;
TreeNode* cur = root;
while (cur != nullptr || !mystack.empty()){
if (cur != nullptr) {
mystack.push(cur);
cur = cur->left;
} else {
cur = mystack.top();
result.emplace_back(cur->val);
mystack.pop();
cur = cur->right;
}
}
return result;
}
};
代码(三刷自解 2024年3月28日)
class Solution {
public:
vector<int> res;
void recursion(TreeNode* root) {
if (root == nullptr) return;
recursion(root->left);
res.emplace_back(root->val);
recursion(root->right);
}
vector<int> inorderTraversal(TreeNode* root) {
res.clear();
recursion(root);
return res;
}
};