108. Convert Sorted Array to Binary Search Tree | 有序数组生成平衡二叉搜索树

来源:互联网 发布:混也是一种生活 知乎 编辑:程序博客网 时间:2024/04/28 05:48

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public TreeNode sortedArrayToBST(int[] nums) {TreeNode node = null;node = helper(nums, 0, nums.length - 1);return node;}public TreeNode helper(int[] nums, int start, int end) {if (start > end) {return null;}int mid = (start + end) / 2;TreeNode node = new TreeNode(nums[mid]);node.left = helper(nums, start, mid - 1);node.right = helper(nums, mid + 1, end);return node;}}


0 0
原创粉丝点击