Apr 21, 2024 · Mar 30, 2024 · Apr 21, 2024 · Mar 30, 2024
diff --git a/problems/0108.将有序数组转换为二叉搜索树.md b/problems/0108.将有序数组转换为二叉搜索树.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -334,6 +334,18 @@ class Solution:
		return root

		```
	递归精简(自身调用)
	```python
	class Solution:
	def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
	if not nums:
	return
	mid = len(nums) // 2
	root = TreeNode(nums[mid])
	root.left = self.sortedArrayToBST(nums[:mid])
	root.right = self.sortedArrayToBST(nums[mid + 1 :])
	return root
	```

		迭代法
		```python
Expand Down