Flatten Binary Tree to Linked List
Difficulty:Medium
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.
Code
Java
Runtime: 296 ms
/**
* Definition for a binary tree node.
* 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;
if(root.left != null) {
TreeNode left = root.left;
TreeNode right = root.right;
root.left = null;
root.right = left;
TreeNode endRight = root.right;
while(endRight.right != null) {
endRight = endRight.right;
}
endRight.right = right;
}
flatten(root.right);
}
}