mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 01:15:57 +08:00
29 lines
978 B
Markdown
Executable File
29 lines
978 B
Markdown
Executable File
# [108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)
|
||
|
||
|
||
## 题目
|
||
|
||
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
|
||
|
||
## 题目大意
|
||
|
||
将一个按照升序排列的有序数组，转换为一棵高度平衡二叉搜索树。本题中，一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。
|
||
|
||
## 解题思路
|
||
|
||
- 把一个有序数组转换成高度平衡的二叉搜索数，按照定义即可
|