首页 > 代码库 > Convert Sorted Array to Binary Search Tree
Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public TreeNode sortedArrayToBST(int[] num) { if(num==null||num.length==0) return null; return sortedArrayToBST(num,0,num.length-1); } private TreeNode sortedArrayToBST(int[] num, int start, int end) { // TODO Auto-generated method stub if(start>end) return null; int mid = (start+end)/2; TreeNode root = new TreeNode(num[mid]); root.left=sortedArrayToBST(num,start,mid-1); root.right=sortedArrayToBST(num,mid+1,end); return root; } }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。