码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode_108. Convert Sorted Array to Binary Search Tree

时间:2019-10-01 18:54:01      阅读:108      评论:0      收藏:0      [点我收藏+]

标签:win   tree   following   bst   div   code   lan   def   ever   

fasffasfa

108. Convert Sorted Array to Binary Search Tree

Easy

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     /    -3   9
   /   /
 -10  5

asfasdf

LeetCode_108. Convert Sorted Array to Binary Search Tree

标签:win   tree   following   bst   div   code   lan   def   ever   

原文地址:https://www.cnblogs.com/denggelin/p/11615512.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!