LeetCode Flatten Binary Tree to Linked List

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.

Tips:

Do not forget to reset left child pointer after adjusting right child pointer.

Solution:

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