难度中等537收藏分享切换为英文关注反馈
给定一个二叉树,返回它的中序 遍历。
示例:
输入: [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> inorderTraversal(TreeNode* root)
{
vector<int> res;
if(root == nullptr) return res;
stack<TreeNode*> s;
TreeNode* cur =root;
while(cur !=NULL || !s.empty())
{
if(cur != NULL)
{
s.push(cur);
cur =cur->left;
}else{
cur = s.top();
res.push_back(cur->val);
s.pop();
cur = cur->right;
}
}
return res;
}
};