tree1 = {"k": 1,
        0: {"k": 2,
            0: {"k": 4, 0: {}, 1: {}},
            1: {}},
        1: {"k": 3,
            0: {"k": 5,
                0: {"k": 7,
                    0: {},
                    1: {"k": 8, 0: {}, 1: {}}},
                1: {}},
            1: {"k": 6, 0: {}, 1: {}}}}


tree2 = {"k": 1,
        0: {"k": 2, 0: {}, 1: {}},
        1: {"k": 3,
            0: {"k": 4,
                0: {"k": 5, 0: {}, 1: {}},
                1: {"k": 6, 0: {}, 1: {}}},
            1: {"k": "A", 0: {}, 1: {}}}}

tree3 = {"k": 1,
        0: {"k": 5,
            0: {"k": 8, 0: {}, 1: {}},
            1: {}},
        1: {"k": 3,
            0: {"k": 5,
                0: {"k": 7,
                    0: {},
                    1: {"k": 8, 0: {}, 1: {}}},
                1: {}},
            1: {"k": 6, 0: {}, 1: {}}}}


# II magassag
def magassag(t):
    if t == {}:
        return 0
    else:
        m1=magassag(t[0])
        m2=magassag(t[1])
    return (max(m1,m2)+1)

magassag(tree1)