迭代,比较给定值与当前值,若给定值比当前值小则往左走,否则往右走(二叉搜索树左子树所有节点的元素值均小于根的元素值,右子树所有节点的元素值均大于根的元素值。)
# 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:
while root:
if val == root.val:
return root
root = root.left if val < root.val else root.right
return None