0108-convert-sorted-array-to-binary-search-tree.adoc

108. Convert Sorted Array to Binary Search Tree

{leetcode}/problems/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.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

解题分析

这道题跟 109. Convert Sorted List to Binary Search Tree 类似。

代码还可以再简化一下。

link:{sourcedir}/_0108_ConvertSortedArrayToBinarySearchTree.java[role=include]