114. 二叉树展开为链表

114. 二叉树展开为链表

难度中等429收藏分享切换为英文关注反馈

给定一个二叉树，原地将它展开为一个单链表。

 

例如，给定二叉树

    1
   / \
  2   5
 / \   \
3   4   6

将其展开为：

1
 \
  2
   \
    3
     \
      4
       \
        5
         \
          6

public void flatten(TreeNode root) {
        if (root == null) {
            return;
        }
        process(root);
    }

    private void process(TreeNode root) {
        if (root.left != null) {
            process(root.left);
        }
        if (root.right != null) {
            process(root.right);
        }
        if (root.left == null) {
        } else if (root.right == null) {
            TreeNode left = root.left;
            root.left = null;
            root.right = left;
        } else {
            //左右子树都有的情况下
            TreeNode right = root.right;
            root.right = root.left;
            root.left = null;
            TreeNode last = root;
            while (last.right != null) {
                last = last.right;
            }
            last.right = right;
        }
    }