class BinaryTree:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None

    def insert_left(self, data):
        self.left = BinaryTree(data)
        return self.left

    def insert_right(self, data):
        self.right = BinaryTree(data)
        return self.right

    def is_balanced(self):
        def check_height(node):
            if node is None:
                return 0
            left_height = check_height(node.left)
            if left_height == -1:
                return -1
            right_height = check_height(node.right)
            if right_height == -1:
                return -1
            if abs(left_height - right_height) > 1:
                return -1
            return max(left_height, right_height) + 1

        return check_height(self) != -1