0108. 将有序数组转换为二叉搜索树 #225
0108. 将有序数组转换为二叉搜索树
#225
giscus[bot]
bot
Replies: 1 comment 1 reply
-
|
空间复杂度 O(logn) |
Beta Was this translation helpful? Give feedback.
1 reply
-
|
我没明白，可以解释一下为啥空间复杂度O(logn)吗? |
Beta Was this translation helpful? Give feedback.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
0108. 将有序数组转换为二叉搜索树
--- 0108. 将有序数组转换为二叉搜索树 标签：树、二叉搜索树、数组、分治、二叉树 难度：简单 题目链接 0108. 将有序数组转换为二叉搜索树 - 力扣 题目大意 描述：给定一个升序的有序数组 nums。 要求：将其转换为一棵高度平衡的二叉搜索树。 说明： 1≤nums.length≤104。 −104≤nums[i]≤104。 nums 按严...
https://algo.itcharge.cn/solutions/0100-0199/convert-sorted-array-to-binary-search-tree/
Beta Was this translation helpful? Give feedback.
All reactions