Leetcode刷题之旅(每日一题)--114. 二叉树展开为链表

最新推荐文章于 2024-03-07 09:15:00 发布

祥哲

最新推荐文章于 2024-03-07 09:15:00 发布

阅读量161

点赞数

文章标签：二叉树 leetcode 链表

本文链接：https://blog.csdn.net/weixin_45129136/article/details/107741433

版权

题目描述：
在这里插入图片描述

思路：前序遍历

/**
 * Definition for a binary tree node.
 * public 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;
 *     }
 * }
 */
class Solution {
    public void flatten(TreeNode root) {
        List<TreeNode> list=new LinkedList();
        preOrderTree(root,list);
        for(int i=1;i<list.size();i++){
            TreeNode prev = list.get(i-1);
            TreeNode curr = list.get(i);
            prev.left = null;
            prev.right = curr;
        }
    }

    public void preOrderTree(TreeNode root,List list){
        if(root!=null){
            list.add(root);
            preOrderTree(root.left,list);
            preOrderTree(root.right,list);
        }
    }
}

但并不是最优解在这里插入图片描述
最优解做法:(很巧妙的一种方法)

附上官方代码：

class Solution {
    public void flatten(TreeNode root) {
        TreeNode curr = root;
        while (curr != null) {
            if (curr.left != null) {
                TreeNode next = curr.left;
                TreeNode predecessor = next;
                while (predecessor.right != null) {
                    predecessor = predecessor.right;
                }
                predecessor.right = curr.right;
                curr.left = null;
                curr.right = next;
            }
            curr = curr.right;
        }
    }
}