Flatten Binary Tree to Linked List

-----QUESTION------

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.

-----SOLUTION------

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* flatRoot = new TreeNode(root->val);
        TreeNode* flatNode = flatRoot;
        TreeNode* current;
        stack<TreeNode*> tree_stack;
        
        if(root->right)
        {
            tree_stack.push(root->right);
        }
            
        if(root->left)
        {
            tree_stack.push(root->left);
        }
        while(!tree_stack.empty())
        {
            current = tree_stack.top();
            tree_stack.pop();
            
            flatNode->right = new TreeNode(current->val); 
            flatNode = flatNode->right;
            
            if(current->right)
            {  
                tree_stack.push(current->right);
            }
            
            if(current->left)
            {
                tree_stack.push(current->left);
            }
            
        }
        
        *root = *flatRoot;
    }
    
};

递归方法也能通过测试

class Solution {
public:
    void flatten(TreeNode *root) {
        if(!root) return;
        TreeNode* newRoot = new TreeNode(root->val);
        preOrderTraverse(root, newRoot);
        *root = *newRoot;
    }
    TreeNode* preOrderTraverse(TreeNode *root, TreeNode * newRoot)
    {
        if(root->left) 
        {
            newRoot->right = new TreeNode(root->left->val);
            newRoot = preOrderTraverse(root->left, newRoot->right);
        }
        if(root->right) 
        {
            newRoot->right = new TreeNode(root->right->val);
            newRoot = preOrderTraverse(root->right, newRoot->right);
        }
        return newRoot;
    }
};