Categorygithub.com/frankegoesdown/leetcode-in-goAlgorithms0108.convert-sorted-array-to-binary-search-tree
package
0.0.0-20190725034537-db5e768ce8c3
Repository: https://github.com/frankegoesdown/leetcode-in-go.git
Documentation: pkg.go.dev
Overview
Versions
1
Dependencies
1
Dependents
0
Files
16 SLOC

# README

108. Convert Sorted Array to Binary Search Tree

题目

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

解题思路

高度平衡二叉树是每一个节点的两个子树的深度差不能超过1。 见程序注释

# Type aliases

No description provided by the author