有序链表转BST（平衡查找二叉树）

最新推荐文章于 2022-03-23 16:35:07 发布

wanhf11

最新推荐文章于 2022-03-23 16:35:07 发布

阅读量542

点赞数

分类专栏：算法基础

本文链接：https://blog.csdn.net/qq_17612199/article/details/52671411

版权

算法基础专栏收录该内容

81 篇文章 0 订阅

订阅专栏


    private static class ListNode {
        public int value;
        public ListNode next = null;
    }

    private static class TreeNode {
        public int value;
        public TreeNode left = null;
        public TreeNode right = null;
    }

    private static TreeNode convertList2Tree(ListNode head, int length) {
        if (head == null || length == 0) return null;
        ListNode leftHead = null, rootHead = null, rightHead = null;
        TreeNode leftRoot = null, root = null, rightRoot = null;
        if (length % 2 == 1) {
            // 1 2 3 [4] 5 6 7
            leftHead = head;
            rootHead = moveList(leftHead, length / 2 + 1);
            rightHead = rootHead.next;
            leftRoot = convertList2Tree(leftHead, length / 2);
            rightRoot = convertList2Tree(rightHead, length / 2);
        } else {
            // 0 1 2 [3] 4 5
            leftHead = head;
            rootHead = moveList(leftHead, length / 2 + 1);
            rightHead = rootHead.next;
            leftRoot = convertList2Tree(leftHead, length / 2);
            rightRoot = convertList2Tree(rightHead, length / 2 - 1);
        }
        root = new TreeNode();
        root.left = leftRoot;
        root.right = rightRoot;
        root.value = rootHead.value;
        return root;
    }