/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root)
{
vector<int> res; //返回结果值
if(root == NULL)
return res;
stack<int> temp;
TreeNode * p = root;
goleft(p,temp,res);
return res;
}
void goleft(TreeNode *root,stack<int> &temp,vector<int> &res)
{
temp.push(root->val);
if(root->left != NULL)
{
TreeNode * l = root->left;
root->left = NULL;
goleft(l,temp,res);
}
if(root->left == NULL)
{
res.push_back(temp.top());
temp.pop();
}
if(root->right != NULL)
{
TreeNode * r = root->right;
root->right = NULL;
goleft(r,temp,res);
}
}
};
算法思路:
写着写着就慢慢转换成了进阶里的迭代算法了,
先用栈存取当前结点的值,然后先向左,若左子树不为空,则进行迭代。若左子树为空,则可以将当前节点的值出栈,压入到返回结果中,然后再向右进行迭代。
ps:难得提交之后两项数据都这么赏心悦目,留个纪念: