Ideas
算法:迭代
数据结构:二叉搜索树
Code
时间复杂度:O(N)
空间复杂度:O(1)
# 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 root.val == val:
return root
root = root.left if val < root.val else root.right
return None