<qiyuangong>700_Search_in_a_Binary_Search_Tree_1.py
def searchBST( root, val):
    while root:
        if root.val == val:
            return root
        elif root.val > val:
            root = root.left
        else:
            root = root.right
    return root
def sample_funcname ( var_0 , val ) :
    while var_0 :
        if var_0.val == val :
            return var_0
        elif var_0.val > val :
            var_0 = var_0.left
        else :
            var_0 = var_0.right
    return var_0
