leetcode700 二叉搜索树中的搜索

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u012343179/article/details/89853160

这道题考的是二叉搜索树的查询。

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def searchBST(self, root, val):
        """
        :type root: TreeNode
        :type val: int
        :rtype: TreeNode
        """
        while root!=None:
            if root.val==val:
                return root
            elif root.val>val:
                root=root.left
            else:
                root=root.right
        return None