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
public class Solution {
public void flatten(TreeNode root) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
if(root==null) return;
flatten(root.left);
flatten(root.right);
TreeNode temp = root;
if(temp.left == null)return;
else{
temp = temp.left;
}
while(temp.right!=null){
temp = temp.right;//move to lefts' most right
}
temp.right = root.right;
root.right = root.left;
root.left = null;
}
}