114. Flatten Binary Tree to Linked List(Leetcode每日一题-2020.08.02)

Problem

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

Example

Given the following tree:

The flattened tree should look like:

Solution

/**
 * 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:
    void flatten(TreeNode* root) {
        while (root) 
        {
            auto p = root->left;
            if (p) //如果有左子树，就把左子树的右链插到右子树之前
            {
                while (p->right) 
                    p = p->right;
                p->right = root->right;
                root->right = root->left;
                root->left = NULL;
            }
            root = root->right;
        }
    }
};