Leedcode二叉搜索树中的搜索[层序遍历+利用性质]

# 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:
        from collections import deque
        queue=deque([root])
        while queue:
            node=queue.popleft()
            if node.val==val:return node
            if node.left:queue.append(node.left)
            if node.right:queue.append(node.right)

# 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:
        if root.val>val and root.left:return self.searchBST(root.left,val)
        if root.val<val and root.right:return self.searchBST(root.right,val)
        if root.val==val:return root