![](https://img-blog.csdnimg.cn/img_convert/d7bc04f83b6f0cee8f18cdce929f26d0.png)
![](https://img-blog.csdnimg.cn/img_convert/7f30d358ff0c67760375ad4841cd52ce.png)
方法一:递归算法
class Solution {
public:
void inorder(TreeNode* root, vector<int>& res) {
if (!root) return ; //如果为空则直接返回
inorder(root->left, res); //向左走
res.push_back(root->val); //将根节点出栈
inorder(root->right, res); //向右走
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
inorder(root, res);
return res;
}
};
![](https://img-blog.csdnimg.cn/img_convert/44aa49ca34257a9e45c722d9d086ab80.png)
方法二:Morris 中序遍历
![](https://img-blog.csdnimg.cn/img_convert/22f274ffcb35ab36a7387c1d39e71ff0.png)
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
TreeNode *predecessor = nullptr;
while (root != nullptr) {
if (root->left != nullptr) {
// predecessor 节点就是当前 root 节点向左走一步,然后一直向右走至无法走为止
predecessor = root->left;
while (predecessor->right != nullptr && predecessor->right != root) {
predecessor = predecessor->right;
}
// 让 predecessor 的右指针指向 root,继续遍历左子树
if (predecessor->right == nullptr) {
predecessor->right = root;
root = root->left;
}
// 说明左子树已经访问完了,我们需要断开链接
else {
res.push_back(root->val);
predecessor->right = nullptr;
root = root->right;
}
}
// 如果没有左孩子,则直接访问右孩子
else {
res.push_back(root->val);
root = root->right;
}
}
return res;
}
};