103. 二叉树的锯齿形层次遍历

思路: 层次遍历: 下面这中方式复杂化了:变动了结点 # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None cl
相关文章
相关标签/搜索