def print_tree(t):
    if t == None:
        return
    if t['type'] == 'leaf':
        print(t['value'])
    else:
        print_tree(t['left'])
        print(t['value'])
        print_tree(t['right'])
def leaf(v):
    return {'type': 'leaf', 'value':v}
def node(v, l, r):
    return {'type': 'node', 'value':v,'left':l, 'right':r}
def find(t, v):
    for c in n:
        if t['value'] == v:
            print( 'match')
        else:
            print('no match')
l1 = leaf(2)
l2 = leaf(8)
n1 = node(5, l1, l2)
l3 = leaf(47)
n2 = node(20,None, l3)
n = node(11, n1, n2)
find(n,11)

def find(t, v):
    if t['value'] == v:
        return v
    if (v > t['value']) or (t.get('right') and t['right']['type'] == 'node' and v >= t['right']['value']):
        find(t['right'])
    if (v < t['value']) or (t.get('left') and t['left']['type'] == 'node' and v <= t['left']['value']):
        find(t['left'])
    return None

def find(t, v):
    try:
        if t['value'] == int(v):
            print('match!')
        else:    
            if int(v) < t['value']:
                find(t['left'], v)
            if int(v) > t['value']:
                find(t['right'], v)
    except:
        KeyError
        print('no match')
find(n, v=input('введите число: '))