Update 0700.二叉搜索树中的搜索.md
This commit is contained in:
parent
a8109b4014
commit
2a94d6ca0f
|
|
@ -212,6 +212,12 @@ Python:
|
|||
递归法:
|
||||
|
||||
```python
|
||||
# Definition for a binary tree node.
|
||||
# class TreeNode:
|
||||
# def __init__(self, val=0, left=None, right=None):
|
||||
# self.val = val
|
||||
# self.left = left
|
||||
# self.right = right
|
||||
class Solution:
|
||||
def searchBST(self, root: TreeNode, val: int) -> TreeNode:
|
||||
# 为什么要有返回值:
|
||||
|
|
|
|||
Loading…
Reference in New Issue