Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g0101_0200.s0108_convert_sorted_array_to_binary_search_tree.Solution

```
public class Solution
extends Object
```
108 - Convert Sorted Array to Binary Search Tree.
Easy

Given an integer array nums where the elements are sorted in ascending order , convert it to a height-balanced binary search tree.

A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.

Example 1:

Input: nums = [-10,-3,0,5,9]

Output: [0,-3,9,-10,null,5]

Explanation: [0,-10,5,null,-3,null,9] is also accepted:

Example 2:

Input: nums = [1,3]

Output: [3,1]

Explanation: [1,3] and [3,1] are both a height-balanced BSTs.

Constraints:
- 1 <= nums.length <= 10⁴
- -10⁴ <= nums[i] <= 10⁴
- nums is sorted in a strictly increasing order.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  TreeNode sortedArrayToBST(int[] num)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

sortedArrayToBST

public TreeNode sortedArrayToBST(int[] num)