给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3] 1 \ 2 / 3 输出: [1,3,2]
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
思路1:递归方法
/**
* 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> result;
vector<int> inorderTraversal(TreeNode* root) {
core(root);
return result;
}
void core(TreeNode* root){
if(root==NULL){
return;
}
core(root->left);
result.push_back(root->val);
core(root->right);
}
};
思路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) {
stack<TreeNode*> s;
vector<int> result;
TreeNode * pNode = root;
while(pNode != NULL || !s.empty())
{
if(pNode != NULL)
{
s.push(pNode); //当前结点入栈
pNode = pNode->left; //转向左子树
}
else
{
pNode = s.top();
result.push_back(pNode->val); //读取栈顶数据
s.pop(); //栈顶弹出
pNode = pNode->right; //转向右子树
}
}
return result;
}
};