python

将一个二叉树逐行遍历，但是遍历方向逐行翻转import time from collections import defaultdict class Node(object): def __init__(self, value, left, right, depth): self.value = value self.left = left self.right = right self.depth = depth rows = defaultdict(list) def