leetcode:Binary Tree Inorder Traversal

来源:互联网 发布:mysql中decode函数 编辑:程序博客网 时间:2024/06/05 18:00
class Solution {public:    vector<int> inorderTraversal(TreeNode *root) {        vector<int> res;        stack<TreeNode *> s;        TreeNode * p = root;        while(p!=NULL||!s.empty())        {            while(p!=NULL)            {                s.push(p);                p = p->left;            }            p = s.top();            res.push_back(p->val);            s.pop();            p = p->right;              }        return res;    }};

0 0