Binary Tree Inorder Traversal

最新推荐文章于 2020-03-25 21:37:40 发布

HEVC_CJL

最新推荐文章于 2020-03-25 21:37:40 发布

阅读量4.6k

点赞数 3

分类专栏： leetcode 文章标签： leetcode Binary Tree Inorder

本文链接：https://blog.csdn.net/HEVC_CJL/article/details/28681977

版权

leetcode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

1. 递归解法

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
    vector<int> result;
    void inorder(TreeNode *root)
    {
        if (root == NULL)
            return;
        inorder(root->left);
        result.push_back(root->val);
        inorder(root->right);
    }
    vector<int> inorderTraversal(TreeNode *root) {
        result.clear();
        inorder(root);
        return result;
    }
};

2. 非递归解法（空间复杂度O(n))

/**
 * Definition for binary tree
 * 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> path;
        stack<TreeNode *> st;
        if (root == NULL)
            return path;
        TreeNode *p = root;
        while (p != NULL || !st.empty())
        {
            while (p != NULL)
            {
                st.push(p);
                p = p->left;
            }
            if (!st.empty())
            {
                p = st.top();
                st.pop();
                path.push_back(p->val);
                p = p->right;
            }
        }
        return path;
    }
};

3. 非递归解法（空间复杂度O(1))

/**
 * Definition for binary tree
 * 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> path;
        if (root == NULL)
            return path;
            
        TreeNode *cur = root;
        TreeNode *pre = NULL;
        while (cur != NULL)
        {
            if (cur->left == NULL)
            {
                path.push_back(cur->val);
                cur = cur->right;
            }
            else
            {
                pre = cur->left;
                while (pre->right != NULL && pre->right != cur)
                    pre = pre->right;
                if (pre->right == NULL)
                {
                    pre->right = cur;
                    cur = cur->left;
                }
                else
                {
                    pre->right = NULL;
                    path.push_back(cur->val);
                    cur = cur->right;
                }
            }
        }
        return path;
    }
};