给定一个二叉树,返回它的中序 遍历。
示例:
输入: [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;
stack<TreeNode*> sta;
while(root || !sta.empty())
{
if(root)
{
sta.push(root);
root = root->left;
}
else
{
root = sta.top();
res.push_back(root->val);
sta.pop();
root = root-> right;
}
}
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> res;
void test_inor(TreeNode* root)
{
if(!root)
return;
test_inor(root->left);
res.push_back(root->val);
test_inor(root->right);
}
vector<int> inorderTraversal(TreeNode* root) {
test_inor(root);
return res;
}
};