[leetcode][tree][dfs] 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

click to show hints.

Hints:

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

方法一：很直接，但非in-place

先序遍历树得到遍历序列存放在vector中，遍历vector将每个节点按要求连接起来

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode* root) {
        if(NULL == root) return;
        //得到先序遍历序列
        vector<TreeNode *> traversalSeq;
        preorderTraversal(root, traversalSeq);
        //连接
        for(int i = 1; i < traversalSeq.size(); ++i){
            traversalSeq[i-1]->left = NULL;//别忘了
            traversalSeq[i-1]->right = traversalSeq[i];
        }
        return;
    }
private:
     void preorderTraversal(TreeNode* root, vector<TreeNode *> &seq){
         if(NULL == root) return;
         seq.push_back(root);
         if(root->left) preorderTraversal(root->left, seq);
         if(root->right) preorderTraversal(root->right, seq);
     }
};

方法二：in-place算法

先序遍历树，并且在遍历过程中就将节点按要求连接起来

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode* root) {
        if(NULL == root) return;
        TreeNode *lastNodeNew = NULL;//新树的最后一个节点
        flattenCore(root, lastNodeNew);
    }
private:
    void flattenCore(TreeNode* root, TreeNode *&lastNodeNew){
        if(NULL == root) return;
        TreeNode *rightChild = root->right;!!!记得记录原始的右孩子，因为root的左右孩子在遍历左子树时会被修改
        if(lastNodeNew){
            lastNodeNew->left = NULL;
            lastNodeNew->right = root;
        }
        lastNodeNew = root;
        if(root->left) flattenCore(root->left, lastNodeNew);
        if(rightChild) flattenCore(rightChild, lastNodeNew);
    }
};

同样的算法，lastNodeNew作为全局变量的实现

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode *lastNodeNew = NULL;//新树的最后一个节点
    void flatten(TreeNode* root) {
        if(NULL == root) return;
        TreeNode *rightChild = root->right;//!!!记得记录原始的右孩子，因为root的左右孩子在遍历左子树时会被修改
        if(lastNodeNew){
            lastNodeNew->left = NULL;
            lastNodeNew->right = root;
        }
        lastNodeNew = root;
        if(root->left) flatten(root->left);
        if(rightChild) flatten(rightChild);
    }
};