[leetcode]Convert SortedList To Binary Search Tree - java 递归

最新推荐文章于 2025-11-24 01:23:29 发布

最新推荐文章于 2025-11-24 01:23:29 发布 · 146 阅读

文章标签：

#leetcode

leetcode 专栏收录该内容

44 篇文章

订阅专栏

本文介绍了一种将有序链表转换为平衡二叉搜索树的方法。通过递归地选择中间元素作为根节点，可以确保生成的二叉树保持平衡状态。此过程涉及将链表元素存储到列表中，然后利用这些元素构建平衡二叉树。

递归构造二叉查找树

/**

 * Definition for singly-linked list.

 * public class ListNode {

 *     int val;

 *     ListNode next;

 *     ListNode(int x) { val = x; next = null; }

 * }

 */

/**

 * Definition for binary tree

 * public class TreeNode {

 *     int val;

 *     TreeNode left;

 *     TreeNode right;

 *     TreeNode(int x) { val = x; }

 * }

 */

public class Solution {

    public TreeNode sortedListToBST(ListNode head) {

        if(head==null){

            return null;

        }

        List<Integer> list = new ArrayList<Integer>();

        ListNode p = head;

        while (p!=null){

            list.add(p.val);

            p = p.next;

        }

        TreeNode root = convert(list, 0, list.size()-1);

        return root;

    }



    private TreeNode convert(List<Integer> list, int start, int end){

        if(start>end){

            return null;

        }

        int mid = start + (end-start)/2;

        TreeNode parent = new TreeNode(list.get(mid));

        TreeNode left = convert(list, start, mid-1);

        parent.left=left;

        TreeNode right = convert(list, mid+1, end);

        parent.right=right;

        return parent;

    }

}