class tree:

        def __init__(self,x):
                self.store=[x,[]]

        def AddSuccessor(self,x):
                self.store[1]=self.store[1]+[x]
                return True

        def Print_DepthFirst(self):
                print self.store[0]
                for i in range(0, len(self.store[1])):
                        self.store[1][i].Print_Helper(1)

        def Print_Helper(self,tab):
                print tab * "\t" + str(self.store[0])
                for i in range(0, len(self.store[1])):
                        self.store[1][i].Print_Helper(tab+1)

        def Get_LevelOrder(self):
                tracker=queue()
                final=[]
                final.append(self.store[0])
                for i in range(0, len(self.store[1])):
                        tracker.enqueue(self.store[1][i])
                while (tracker != []):
                        adder=tracker.dequeue()
                        if adder==False:
                                break
                        else:
                                final.append(adder.store[0])
                                if (adder.store != []):
                                        for i in range(0,len(adder.store[1])):
                                                tracker.enqueue(adder.store[1][i])
                print final
                return final