LeetCode 114. 二叉树展开为链表

问题描述：

 解题思路：

1，先将左子树展开为单链表，再把右子树展开为单链表。

2，把左子树作为右子树。

3，把原来右子树接到现在右子树尾部，形成新的链表。

题解：

/**

* Definition for a binary tree node.

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode() {}

* TreeNode(int val) { this.val = val; }

* TreeNode(int val, TreeNode left, TreeNode right) {

* this.val = val;

* this.left = left;

* this.right = right;

* }

* }

*/

class Solution {

public void flatten(TreeNode root) {

if(root == null){

return ;

}

flatten(root.left);

flatten(root.right);

TreeNode left = root.left;

TreeNode right = root.right;



root.left = null;

root.right = left;



TreeNode p = root;

while(p.right!= null){

p = p.right;

}

p.right = right;

}

}