题目
给定一个二叉树,返回它的中序 遍历。
示例
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
算法实现:递归
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
return dfs(root, res);
}
vector<int> dfs(TreeNode* root, vector<int> res) {
if (!root) return res;
res = dfs(root->left, res);
res.push_back(root->val);
res = dfs(root->right, res);
return res;
}
};
结果
算法实现:迭代
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> sta;
while (!sta.empty() || root) {
while (root) {
sta.push(root);
root = root->left;
}
root = sta.top();
sta.pop();
res.push_back(root->val);
root = root->right;
}
return res;
}
};