Leetcode 108. Convert Sorted Array to Binary Search Tree

题目链接：https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/

方法一 递归

1 方法思想

2 代码实现

/**
 * 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) {
        return buildBinaryTree(nums, 0, nums.length);
    }

    // 数组为左闭右开
    public TreeNode buildBinaryTree(int[] nums, int startIndex, int endIndex) {

        if (startIndex >= endIndex) return null;
        int index = startIndex + (endIndex - startIndex) / 2;
        TreeNode root = new TreeNode(nums[index]);
        root.left = buildBinaryTree(nums, startIndex, index);
        root.right = buildBinaryTree(nums, index + 1, endIndex);
        return root;
    }
}

3 复杂度分析

时间复杂度：
空间复杂度：

4 涉及到知识点

5 总结