首页 > 代码库 > Convert Sorted List to Binary Search Tree
Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
答案
/** * 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 { int []array; public TreeNode sortListToBST(int start ,int end) { int middle=start+((end-start)>>1); TreeNode root=new TreeNode(array[middle]); if(middle>start) { root.left=sortListToBST(start,middle-1); } if(middle<end) { root.right=sortListToBST(middle+1,end); } return root; } public TreeNode sortedListToBST(ListNode head) { if(head==null) { return null; } array=new int[65535]; int N=0; while(head!=null) { array[N++]=head.val; head=head.next; } return sortListToBST(0,N-1); } }
Convert Sorted List to Binary Search Tree
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。