LeetCode — Convert Sorted Array to Binary Search Tree

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 <= 104
  • -104 <= nums[i] <= 104
  • nums is sorted in a strictly increasing order.

Solution:

--

--

--

Dell Technologies — VxRail Software Engineer 👨‍💻

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

How ES6 classes really work and how to build your own

Awesome Woodworking Projects You Need To Try — 58

meme

South African ports chaos sees ships start to reroute

AMG Logistics

Analyze Angular Bundle-size To Improve Application Load Time.

photo of speedometer to symbolize perfomance

Webix Gantt and Resource Management

Internationalization based on User’s Input in WSO2 Identity Server

A Simple React Native Navigation Drawer

How to use Axios with React

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Steven Lu

Steven Lu

Dell Technologies — VxRail Software Engineer 👨‍💻

More from Medium

Introduction To Binary Trees In Java

Leetcode Q457. Circular Array Loop (Q388)

LeetCode — First Bad Version

LeetCode — Search in Rotated Sorted Array