LeetCode--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.

方法一：前序遍历。先找到最下层左子树的节点，然后把右子树的节点接上去，再把左字树换到右子树的位置，最后回溯向上。

/**
 * 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(!root) return;
        flatten(root->left);
        flatten(root->right);
        if(!root->left) return;
        TreeNode *p=root->left;
        while(p->right) p=p->right;
        p->right=root->right;
        root->right=root->left;
        root->left=NULL;
    }
};

方法二：堆栈。先保存右子树的节点，然后把左子树的节点换到右边，再把右子树的节点接到左子树的下面，直到栈为空。

/**
 * 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(!root) return;
        stack<TreeNode*>s;
        s.push(root);
        while(!s.empty()){
            TreeNode *p=s.top();
            s.pop();
            if(p->right)
                s.push(p->right);
            if(p->left)
                s.push(p->left);
            p->left=NULL;
            if(!s.empty())
                p->right=s.top();
        }
    }
};