[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

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