Flatten Binary Tree to Linked List LeetCode solution in Java

1
class Solution {
2
  public void flatten(TreeNode root) {
3
    TreeNode curr = root;
4
    while (curr != null) {
5
      if (curr.left != null) {
6
        TreeNode prev = curr.left;
7
        while (prev.right != null) prev = prev.right;
8
        prev.right = curr.right;
9
        curr.right = curr.left;
10
        curr.left = null;
11
      }
12
      curr = curr.right;
13
    }
14
  }
15
}