arrow_back Back to Challenges

#108 Convert Sorted Array to Binary Search Tree

Easy Acceptance 0%
description

Problem Description

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

checklist Constraints

See problem description for detailed constraints.

science Examples

Case #1

In: # See problem description for input format
Out: # Expected output

Mastery Tags

Binary Search Recursion Trees

Hiring Companies

Oracle Uber
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude