Flatten Binary Tree to Linked List

题目

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

For example,
Given

         1
        / \
       2   5
      / \   \
     3   4   6

The flattened tree should look like:

   1
    \
     2
      \
       3
        \
         4
          \
           5
            \
             6

Hints: If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.

思路

            1
         / \
        2   5
       / \   \
      3   4   6

先变成

      1
       \
        2   
       / \   
      3   4   

            \

              5

                \

                  6

实现代码

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(!root)
            return ;
        TreeNode *tmpR = root->right;
        if(root->left!=NULL)
        {
            TreeNode *tmpL = root->left;
            root->right = root->left;
            root->left = NULL;
            while(tmpL->right)
                tmpL = tmpL->right;
            tmpL->right = tmpR;
        }
        flatten(root->right);        
    }     
};

思路二：应用二叉树的pre-order遍历方法

  1

  / \

2   3

先变成

1

   \

     2

        \

         3

并返回 3作为新的尾节点

 

实现代码

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(!root)
            return ;    
        myflatten(root);
    } 
    
    TreeNode *myflatten(TreeNode *root)
    {
        if(!root)
            return NULL;
        TreeNode *tailL = myflatten(root->left);
        TreeNode *tailR = myflatten(root->right);
        if(tailL)
        {
            tailL->right = root->right;
            root->right = root->left;
            root->left = NULL;
        }
        if(tailR)
           return tailR;
        if(tailL)
            return tailL;        
        return root;
    }
        
};