基于二叉树节点类的定义，给出如下Python搜索代码：

def Search(root, val):
    if root is None:
        return None
    if root.val == val:
        return root
    else:
        rtn = search(root.left, val)
    if rtn != None:
        return rtn
    return search(root.right, val)