首页 > 代码库 > [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.
/** * 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) { return sortedArrayToBSTHelper(num, 0, num.length); } public TreeNode sortedArrayToBSTHelper(int[] num, int startIndex, int length) { if (length <= 0) return null; int rootIndex = startIndex + length/2; int leftLength = rootIndex - startIndex; int rightLength = length - leftLength - 1; TreeNode root = new TreeNode(num[rootIndex]); root.left = sortedArrayToBSTHelper(num, startIndex, leftLength); root.right = sortedArrayToBSTHelper(num, rootIndex+1, rightLength); return root; }}
[LeetCode] Convert Sorted Array to Binary Search Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。