Leetcode700. 二叉搜索树中的搜索 Search in a Binary Search Tree - Python 递归法/迭代法

二叉搜索树的特点：

左子树的所有节点值 都比 root.val小

右子树的所有节点值 都比 root.val大

可利用此特性写code：

递归法

# 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: Optional[TreeNode], val: int) -> Optional[TreeNode]:
        
        if root == None or root.val == val:
            return root
        if root.val > val: return self.searchBST(root.left, val)
        if root.val < val: return self.searchBST(root.right, val)

迭代法：

# 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: Optional[TreeNode], val: int) -> Optional[TreeNode]:
        
        while root != None:
            if root.val > val: root = root.left
            elif root.val < val: root = root.right
            else: return root