Challenge
Challenge
Problem
Solutions
Submissions
Challenge Points: 10
Level: EasyYou are given an integer array nums, where the elements are sorted in ascending order.
Your task is to convert this sorted array into a height-balanced Binary Search Tree (BST).
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 1.
Your goal is to construct and return the root node of the height-balanced BST.
Input: nums = [-8, -4, 0, 3, 7, 10]
Output: [3, -4, 7, -8, 0, 10]
Input: nums = [2, 5, 8, 12, 14]
Output: [8, 5, 12, 2, null, null, 14]
Accepted:
Submission:
Report an issue
Code
You need toto run or submitYou need toto run or submit
Test Case
Test Result