103. Binary Tree Zigzag Level Order Traversal
发布时间:2020-12-14 04:33:53 所属栏目:大数据 来源:网络整理
导读:树的蜿蜒型层次遍历 要求第一层从左向右,第二层从右向左...依次类推 和102题无本质区别,加一个翻转指示器即可 # Definition for a binary tree node. # class TreeNode: # def __init__(self,x): # self.val = x # self.left = None # self.right = None cla
树的蜿蜒型层次遍历 要求第一层从左向右,第二层从右向左...依次类推 和102题无本质区别,加一个翻转指示器即可 # Definition for a binary tree node. # class TreeNode: # def __init__(self,x): # self.val = x # self.left = None # self.right = None class Solution: def zigzagLevelOrder(self,root: TreeNode) -> List[List[int]]: if not root: return [] nodelist = [root] result = [] order = True while nodelist: tmplist = [] vallist = [] for node in nodelist: vallist.append(node.val) if node.left: tmplist.append(node.left) if node.right: tmplist.append(node.right) if not order: vallist.reverse() order = not order result.append(vallist) nodelist = tmplist return result (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |