算法思想:
没看答案。
- 和前序、后序遍历一样,利用递归思想。
- 中序遍历指的是按照访问左子树——根节点——右子树的方式遍历这棵树,而在访问左子树或者右子树的时候我们按照同样的方式遍历,直到遍历完整棵树。
C++
/**
* 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> res;
void nums(TreeNode* root){
if(root == nullptr) return;
nums(root->left);
res.push_back(root->val);
nums(root->right);
}
vector<int> inorderTraversal(TreeNode* root) {
nums(root);
return res;
}
};
中序遍历的非递归实现,利用栈和curr遍历指针,来延申根节点的左子树。
/**
* 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> res;
if (!root) return res;
stack<TreeNode*> stk;
TreeNode* curr = root;
while (curr != nullptr || !stk.empty()){
if (curr != nullptr) {
stk.push(curr);
curr = curr->left;
} else {
curr = stk.top();
stk.pop();
res.push_back(curr->val);
curr = curr->right;
}
}
return res;
}
};