Cacher is the code snippet organizer for pro developers

#binary tree implementation
class node(object):
    
    def __init__(self, head, left=None, right=None):
        self.head = head
        self.left = left
        self.right = right

#even btree
def make_btree(lst):
    bt = node(lst.pop())
    route = 'left'
    while lst != []:
        current = bt
        if current.left == None:
            current.left = node(lst.pop())
        elif current.right == None:
            current.right = node(lst.pop())
        else:
            current = current.__dict__[route]
            if route == 'left':
                route = 'right'
            else:
                route = 'left'
    return bt