bfs
feeeeeeet
这个作者很懒,什么都没留下…
展开
-
Leetcode 102 & 107. Binary Tree Level Order Traversal I & II
Binary Tree Level Order TraversalGiven a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).For example:Given...原创 2019-01-18 03:41:03 · 96 阅读 · 0 评论 -
Leetcode 103. Binary Tree Zigzag Level Order Traversal
# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def zigzagLevelOr...原创 2019-01-18 04:51:46 · 98 阅读 · 0 评论