首页>itarticle>102. binary tree level order traversal
102. binary tree level order traversal
admin11月 12, 20200
importQueue# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = NoneclassSolution(object):deflevelOrder(self,root):""" :type root: TreeNode :rtype: List[List[int]] """ifroot==None:return[]queue=Queue.Queue()queue.put(root)# record each layerallnode=[]# record val of item of each layerwhilenotqueue.empty():newlist=[]count=0# count number for poplength=queue.qsize()# origin lengthwhilecount<length:item=queue.get()newlist.append(item.val)# all val of item of each layerifitem.left:# add leftqueue.put(item.left)ifitem.right:# add rightqueue.put(item.right)count+=1allnode.append(newlist)# now queue is emptyreturnallnode
近期评论