Name	Name	Last commit message	Last commit date
parent directory ..
README.md	README.md
convert-sorted-array-to-binary-search-tree.go	convert-sorted-array-to-binary-search-tree.go
convert-sorted-array-to-binary-search-tree_test.go	convert-sorted-array-to-binary-search-tree_test.go

Name

Last commit message

Last commit date

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。见程序注释