Leetcode: Flatten Binary Tree to Linked List

最新推荐文章于 2024-09-23 09:09:10 发布

YMHH

最新推荐文章于 2024-09-23 09:09:10 发布

阅读量602

点赞数

分类专栏： Leetcode 文章标签： leetcode 二叉树

本文链接：https://blog.csdn.net/ymhhym/article/details/17840951

版权

Leetcode 专栏收录该内容

249 篇文章 0 订阅

订阅专栏

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

The flattened tree should look like:

需要注意把左节点置成空。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode *root) {
        
        flattenUtil(root);
    }
    
    TreeNode *flattenUtil(TreeNode *root) {
        if (root == NULL) {
            return NULL;
        }
        
        if (root->left != NULL) {
            TreeNode *right = root->right;
            root->right = flattenUtil(root->left);
            if (right != NULL) {
                TreeNode *tail = findTail(root);
                tail->right = flattenUtil(right);
            }
        }
        else if (root->right != NULL) {
            root->right = flattenUtil(root->right);
        }
        root->left = NULL;
        
        return root;
    }
    
    TreeNode *findTail(TreeNode *head) {
        if (head == NULL) {
            return NULL;
        }
        
        while (head->right != NULL) {
            head = head->right;
        }
        
        return head;
    }
};

====================第二次========================

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode *root) {
        flatten_util(root);
    }
    
    TreeNode *flatten_util(TreeNode *root) {
        if (root == NULL) {
            return NULL;
        }
        
        TreeNode *right = root->right;
        root->right = flatten_util(root->left);
        root->left = NULL;
        
        TreeNode *tail = root;
        while (tail->right != NULL) {
            tail = tail->right;
        }
        tail->right = flatten_util(right);
        
        return root;
    }
};

非递归的解法，前序遍历。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode *root) {
        TreeNode *prev = NULL;
        stack<TreeNode*> nodes;
        while (root != NULL || !nodes.empty()) {
            while (root != NULL) {
                if (root->right != NULL) {
                    nodes.push(root->right);
                }
                
                if (prev == NULL) {
                    prev = root;
                }
                else {
                    prev->right = root;
                    prev->left = NULL;
                    prev = root;
                }
                root = root->left;
            }
            if (!nodes.empty()) {
                root = nodes.top();
                nodes.pop();
            }
        }
    }
};