树的蜿蜒型层次遍历
要求第一层从左向右,第二层从右向左...依次类推
和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
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。