23-BST_Level_Order_Traversal.py

import sys

class Node:
    def __init__(self,data):
        self.right=self.left=None
        self.data = data
class Solution:
    def insert(self,root,data):
        if root==None:
            return Node(data)
        else:
            if data<=root.data:
                cur=self.insert(root.left,data)
                root.left=cur
            else:
                cur=self.insert(root.right,data)
                root.right=cur
        return root

def levelOrder(self, root):
    Q = []
    if (root.data is not None):
        Q.append(root)
    answer = ""
    while (Q):
        current = Q[0]
        answer = answer + str(current.data) + " "
        if current.left is not None:
            Q.append(current.left)
        if current.right is not None:
            Q.append(current.right)
        Q.pop(0)
    print(answer)

T=int(input())
myTree=Solution()
root=None
for i in range(T):
    data=int(input())
    root=myTree.insert(root,data)
myTree.levelOrder(root)