# Definition for a binary tree node.
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
from typing import List
class Solution:
def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
# 如果串列為空的話，就回傳空節點
if nums == [] : return
# 取串列中間的那個值，當做根節點
mid = len(nums) // 2
mid_value = https://www.cnblogs.com/cong12586/p/nums[mid]
root = TreeNode(mid_value)
# 串列左邊的值為根節點的左兒子，
root.left = self.sortedArrayToBST(nums[:mid])
# 右邊的值為根節點的右兒子
root.right = self.sortedArrayToBST(nums[mid + 1 :])
return root
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/131476.html
標籤：Python
下一篇：定位和洗掉重復