给定一个二叉树,原地将它展开为链表。
例如,给定二叉树
1
/
2 5
/ \
3 4 6
将其展开为:
1
2
3
4
5
6
先右后左
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
TreeNode pre = null;
public void flatten(TreeNode root) {
if(root==null) return;
flatten(root.right) ;
flatten(root.left) ;
root.right=pre;
root.left=null;
pre=root;
}
}