题目

Given 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 binary tree [3,9,20,null,null,15,7],

   3/ \
  9  20/  \
   15   7

return its bottom-up level order traversal as:

[[15,7],[9,20],[3]
]

myanswer:

只需在102. Binary Tree Level Order Traversal改动一行即可

class Solution:def levelOrderBottom(self, root):""":type root: TreeNode:rtype: List[List[int]]"""if not root:return []res, level = [],[root]while level:currentNode = []nextLevel = []for node in level:currentNode.append(node.val)if node.left:nextLevel.append(node.left)if node.right:nextLevel.append(node.right)res.insert(0, currentNode)   # 每次都给插入到列表的头部level = nextLevelreturn res

107. Binary Tree Level Order Traversal II相关推荐

LeetCode 107. Binary Tree Level Order Traversal II
LeetCode 107. Binary Tree Level Order Traversal II Solution1:我的答案比102那道题多了一行代码... /*** Definition f ...
LeetCode: 107. Binary Tree Level Order Traversal II
题目 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from l ...
Leet Code OJ 107. Binary Tree Level Order Traversal II [Difficulty: Easy]
题目: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from ...
[Leetcode]@python 107. Binary Tree Level Order Traversal II
题目链接 https://leetcode.com/problems/binary-tree-level-order-traversal-ii/ 题目原文 Given a binary tree, r ...
Leetcode | 107. Binary Tree Level Order Traversal II
题目:二叉树的层次遍历 II 1. 代码①:深度优先搜索(链接) /*** Definition for a binary tree node.* struct TreeNode {* int val ...
利用bds和dfs解决 LeetCode 107. Binary Tree Level Order Traversal II
问题简述给定一棵二叉树,返回该二叉树自底向上遍历的结点值(即从左到右,自底向上) 比如给定一颗二叉树 [3,9,20,null,null,15,7] 3/ \ 9 20/ \ 15 7 返回的结果为 ...
Binary Tree Level Order Traversal II 解题思路
思路: 与Binary Tree Level Order Traversal I 几乎一样.只是最后将结果存放在栈里,然后在栈里再传给向量即可. 再次总结思路: 两个queue,先把第一个放进q1,循 ...
Binary Tree Level Order Traversal II leetcode java
题目: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from ...
leetcode 二叉树的层次遍历 II(Binary Tree Level Order Traversal II)
目录题目描述: 示例: 解法: 题目描述: 给定一个二叉树,返回其节点值自底向上的层次遍历. (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历) 示例: 给定二叉树 [3,9,20,null ...

107. Binary Tree Level Order Traversal II

题目

myanswer:

107. Binary Tree Level Order Traversal II相关推荐

最新文章

热门文章