Method push

data_structures/binary_tree/avl_tree.py:25–27

(self, data: Any)

        return self.head == self.tail

    def push(self, data: Any) -> None:
        self.data.append(data)
        self.tail = self.tail + 1

    def pop(self) -> Any:
        ret = self.data[self.head]