Convert Sorted Array to Binary Search Tree

IF
AlgoAxiomStaff Engineers
JSTS
Easy20 mins

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

Source: Tree Depth-First Search pattern — AlgoAxiom
JavaScript
Test Case 1
root = [1, 2, 3]
Test Case 2
root = [1, 2, 3, 4, 5]
Idle