给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [1,3,2]
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
首先给出基本的递归实现方法:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> add(vector<int>& res, TreeNode* root) {
if (root->left != nullptr) {
add(res, root->left);
}
res.push_back(root->val);
if (root->right != nullptr) {
add(res, root->right);
}
return res;
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
if (root == nullptr) {
return res;
}
res = add(res, root);
return res;
}
};
之后是基于栈的遍历:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
if (root == nullptr) {
return res;
}
stack<TreeNode*> s;
TreeNode* p = root;
while ((!s.empty()) || (p != nullptr)) {
while (p != nullptr) {
s.push(p);
p = p->left;
}
p = s.top();
s.pop();
res.push_back(p->val);
p = p->right;
}
return res;
}
};