LeetCode 练习#
Search in a Binary Search Tree#
https://leetcode.com/problems/search-in-a-binary-search-tree/description/
Solution
1# Definition for a binary tree node.
2# class TreeNode:
3# def __init__(self, val=0, left=None, right=None):
4# self.val = val
5# self.left = left
6# self.right = right
7class Solution:
8 def searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
9
10 if root is None:
11 return None
12
13 if val < root.val:
14
15 return self.searchBST(root.left, val)
16 if val > root.val:
17
18 return self.searchBST(root.right, val)
19
20 else:
21 return root