Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- """
- 366. Find Leaves of Binary Tree
- 用的是层层玻璃的方法, 没经过一次while loop 所有的叶节点,都会笔记录下来,并移除掉
- """
- class Solution(object):
- def remove(self, node, ls):
- if not node:
- return None
- if not node.left and not node.right: #如果是叶节点,append到ls中,并且返回 None
- ls.append(node.val)
- return None
- node.left = self.remove(node.left, ls) # 这一步其实是在移除叶节点
- node.right = self.remove(node.right, ls)
- return node
- def findLeaves(self, root):
- """
- :type root: TreeNode
- :rtype: List[List[int]]
- """
- res = []
- while root:
- leaves = [] # 记录每一次循环的叶节点
- root = self.remove(root, leaves)
- res.append(leaves)
- return res
Advertisement
Add Comment
Please, Sign In to add comment