/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
if(nums == null || nums.length == 0) return null;
return createTree(nums, 0, nums.length - 1);
}
private TreeNode createTree(int[] nums, int start, int end){
if(start > end) return null;
int mid = start + (end - start) / 2;
TreeNode node = new TreeNode(nums[mid]);
node.left = createTree(nums, start, mid - 1);
node.right = createTree(nums, mid + 1, end);
return node;
}
}
leetcode
challenge
Here is the link for the problem:
https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
Oldest comments (0)