LeetCode_108. Convert Sorted Array to Binary Search Tree

Posted 2022-12-10 denggelin

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode_108. Convert Sorted Array to Binary Search Tree相关的知识，希望对你有一定的参考价值。

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的主要内容，如果未能解决你的问题，请参考以下文章