Skip to content

Latest commit

 

History

History
22 lines (9 loc) · 437 Bytes

File metadata and controls

22 lines (9 loc) · 437 Bytes

Convert Sorted Array to Binary Search Tree

描述

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

分析

二分法。

代码

{% codesnippet "./code/convert-sorted-array-to-binary-search-tree."+book.suffix, language=book.suffix %}{% endcodesnippet %}

相关题目