Day 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):
        #Write your code here
        if root is None:
            return 
        
        m = []
        m.append(root)

        while len(m) !=0:
            h = m.pop(0)
            print(h.data, end=' ')
            if h.left is not None:
                m.append(h.left)
            if h.right is not None:
                m.append(h.right)

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