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.
public void flatten(TreeNode root) {
if (root == null) return;
if (root.left !=null) {
TreeNode left = root.left;
TreeNode right = root.right;
root.left = null;
root.right = left;
TreeNode rightMore = root.right;
while(rightMore.right!=null){
rightMore = rightMore.right;
}
rightMore.right = right;
}
flatten(root.right);
}