Python学习——leetcode(Binary Tree Level Order Traversal)

来源:互联网 发布:python import 和from 编辑:程序博客网 时间:2024/06/06 02:42
<pre name="code" class="python">class Solution:    # @param root, a tree node    # @return a list of lists of integers    def levelOrder(self, root):queue=[]l=[]if root:queue.append(root)while len(queue)>0:length=len(queue)tempList=[]while length>0:tempNone=queue.pop()length-=1tempList.append(tempNone.val)if tempNone.left!=None:queue.insert(0,tempNone.left)if tempNone.right!=None:queue.insert(0,tempNone.right)l.append(tempList)return lelse:return l



0 0
原创粉丝点击