1. 递归解法
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
if(root) {
inorderTraversal(root->left);
res.push_back(root->val);
inorderTraversal(root->right);
}
return res;
}
private:
vector<int> res;
};
2. 非递归解法
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> st;
TreeNode *p = root;
while(!st.empty() || p) {
if(p) {
st.push(p);
p = p->left;
} else {
p = st.top();
st.pop();
res.push_back(p->val);
p = p->right;
}
}
return res;
}
};