Java实现将二叉树展开为链表的两种方法

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode() {}
    TreeNode(int val) { this.val = val; }
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}

public class Solution {
    public void flatten(TreeNode root) {
        TreeNode curr = root;
        while (curr != null) {
            if (curr.left != null) {
                // 找到左子树的最右节点
                TreeNode prev = curr.left;
                while (prev.right != null) {
                    prev = prev.right;
                }
                // 将右子树接到最右节点
                prev.right = curr.right;
                // 将左子树移到右侧，并清空左侧
                curr.right = curr.left;
                curr.left = null;
            }
            // 处理下一个节点
            curr = curr.right;
        }
    }
}

import java.util.ArrayList;
import java.util.List;

class Solution {
    public void flatten(TreeNode root) {
        if (root == null || (root.left == null && root.right == null)) return;
        List<TreeNode> result = new ArrayList<>();
        preOrder(root, result);
        // 重建链表
        for (int i = 0; i < result.size() - 1; i++) {
            TreeNode prev = result.get(i);
            TreeNode cur = result.get(i + 1);
            prev.left = null;
            prev.right = cur;
        }
    }

    private void preOrder(TreeNode root, List<TreeNode> result) {
        if (root == null) return;
        result.add(root);
        preOrder(root.left, result);
        preOrder(root.right, result);
    }
}

private void preOrder(TreeNode root, List<TreeNode> result) {
    Deque<TreeNode> stack = new ArrayDeque<>();
    TreeNode node = root;
    while (node != null || !stack.isEmpty()) {
        while (node != null) {
            result.add(node);
            stack.push(node);
            node = node.left;
        }
        node = stack.pop();
        node = node.right;
    }
}