Binary Tree Level order traversal

binarytree.py

class Node:

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

class BinaryTree:

    def __init__(self):
        self.root = None

    def printLevelOrder(self):
        queue = []
        queue.append(self.root)
        while len(queue) > 0:
            node = queue.pop(0)
            print(node.data, end = ' ')

            if node.left is not None:
                queue.append(node.left)

            if node.right is not None:
                queue.append(node.right)

tree = BinaryTree()
tree.root = Node(5)
tree.root.left = Node(3)
tree.root.right = Node(7)
tree.root.left.left = Node(2)
tree.root.left.right = Node(4)
tree.root.right.left = Node(6)
tree.root.right.right = Node(8)
print("The level order traversal of the tree is:")
tree.printLevelOrder()