按層次遍歷，記錄下對應(yīng)節(jié)點(diǎn)的val和所在層，然后經(jīng)過一定變換得到輸出。python代碼如下：

# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): def zigzagLevelOrder(self, root): """ :type root: TreeNode :rtype: List[List[int]] """ tmp = [] if root == None: return tmp tmp.append(root) tmp_list = [] cengshu = 0 while(tmp != []): tmp_next = [] for i in range(len(tmp)): tmp_list.append([tmp[i].val , cengshu]) if tmp[i].left != None: tmp_next.append(tmp[i].left) if tmp[i].right != None: tmp_next.append(tmp[i].right) tmp = tmp_next cengshu += 1 from collections import defaultdict dict_new = defaultdict(list) for i in range(len(tmp_list)): dict_new[tmp_list[i][1]].append(tmp_list[i][0]) final_return = [] for i in range(len(dict_new.values())): if i % 2 == 0: final_return.append(dict_new.values()[i]) else: t = dict_new.values()[i] t.reverse() final_return.append(t) return final_return

總結(jié)

以上是生活随笔為你收集整理的c++二叉树的层序遍历_leetcode 103. 二叉树的锯齿形层序遍历的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。