/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public void flatten(TreeNode root) {
if(root == null){
return;
}
List<TreeNode> nodeList = new ArrayList<TreeNode>();
f(root, nodeList);
TreeNode pre = null;
for(TreeNode node : nodeList){
if(pre != null){
pre.left=null;
pre.right=node;
}
pre = node;
}
}
private void f(TreeNode node, List<TreeNode> nodeList){
nodeList.add(node);
if(node.left != null){
f(node.left, nodeList);
}
if(node.right!=null){
f(node.right, nodeList);
}
}
}