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