[LeetCode]题解（python）：108-Convert Sorted Array to Binary Search Tree

题目来源：

　　https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

题意分析：

　　给出一个排好序的数组，根据这个数据形成一个高度平衡的搜索二叉树。

题目思路：

　　将中位数为根节点，中位数左边为左子树，右边为右子树。

代码（python）：

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = Noneclass Solution(object):def sortedArrayToBST(self, nums):""":type nums: List[int]:rtype: TreeNode"""size = len(nums)if size == 0:return Noneif size == 1:return TreeNode(nums[0])size //= 2root = TreeNode(nums[size])root.left = self.sortedArrayToBST(nums[:size])root.right = self.sortedArrayToBST(nums[size + 1:])return root

View Code

转载于:https://www.cnblogs.com/chruny/p/5258311.html

[LeetCode]题解（python）：108-Convert Sorted Array to Binary Search Tree相关推荐

【数组递归构造二叉树】LeetCode 108. Convert Sorted Array to Binary Search Tree
LeetCode 108. Convert Sorted Array to Binary Search Tree Solution1:我的答案构造二叉树利用递归 /*** Definition fo ...
LeetCode: 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. ...
leetcode python3 简单题108. Convert Sorted Array to Binary Search Tree
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百零八题 (1)题目英文: Given an array where elem ...
LeetCode 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 ...
leetcode 108. Convert Sorted Array to Binary Search Tree | 108. 将有序数组转换为二叉搜索树（Java）
题目 https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ 题解经典二分,不解释了,直接看代码 /*** ...
108. Convert Sorted Array to Binary Search Tree
一.题目 1.审题 2.分析给出一个有序的不重复的整形数组,组成一个二路平衡二叉树(左右子树高度差不超过1). 二.解答 1.思路: 方法一. 采用递归的方式.(像二分查找) ①.为了保持平衡,查找 ...
Convert Sorted Array to Binary Search Tree - LeetCode
目录题目链接注意点解法小结题目链接 Convert Sorted Array to Binary Search Tree - LeetCode 注意点不要访问空结点题目要求的是平衡二叉搜 ...
LeetCode: Convert Sorted Array to Binary Search Tree 解题报告
Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending ord ...
Convert Sorted Array to Binary Search Tree With Minimal Height
Given a sorted (increasing order) array, Convert it to create a binary tree with minimal height. Exa ...
【leetcode刷题笔记】Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 题解 ...

[LeetCode]题解（python）：108-Convert Sorted Array to Binary Search Tree

[LeetCode]题解（python）：108-Convert Sorted Array to Binary Search Tree相关推荐

最新文章

热门文章