1.递归
思路:
根据中序遍历的定义:递归遍历左子树、根节点、右子树。
代码:
/**
* 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 inorder(TreeNode* root, vector<int> &res){
if(root){
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;
}
};
2. 迭代(栈)
思路:
递归时隐式维护了一个栈,现在使用迭代的思路将这个栈显示建立,栈的创建思路:
代码:
/**
* 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;
stack<TreeNode*> noteStack;
while(root!=nullptr || !noteStack.empty()){
while(root!=nullptr){
noteStack.push(root);
root = root->left;
}
root = noteStack.top();
res.push_back(root->val);
noteStack.pop();
root = root->right;
}
return res;
}
};