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