LeetCode 107. Binary Tree Level Order Traversal II（二叉树分层遍历）
来源：互联网 发布：在淘宝点击卖家没反应 编辑：程序博客网 时间：2024/05/16 14:39
原题网址：https://leetcode.com/problems/binary-tree-level-order-traversal-ii/
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,#,#,15,7},
3 / \ 9 20 / \ 15 7
return its bottom-up level order traversal as:
[ [15,7], [9,20], [3]]
方法：广度优先搜索。
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public List<List<Integer>> levelOrderBottom(TreeNode root) { List<List<Integer>> levels = new ArrayList<>(); if (root == null) return levels; List<TreeNode> currents = new ArrayList<>(); currents.add(root); while (!currents.isEmpty()) { List<Integer> level = new ArrayList<>(); for(TreeNode current:currents) level.add(current.val); levels.add(0, level); List<TreeNode> nexts = new ArrayList<>(); for(TreeNode current:currents) { if (current.left != null) nexts.add(current.left); if (current.right != null) nexts.add(current.right); } currents = nexts; } return levels; }} 0 0
- LeetCode 107. Binary Tree Level Order Traversal II（二叉树分层遍历）
- Binary Tree Level Order Traversal 分层遍历二叉树@LeetCode
- Leetcode Binary Tree Level Order Traversal 二叉树分层遍历
- Leetcode Binary Tree Level Order Traversal II 二叉树分层遍历
- LeetCode 102. Binary Tree Level Order Traversal（二叉树分层遍历）
- Leetcode 103 ，Binary Tree Zigzag Level Order Traversal（二叉树Z形分层遍历）
- 107.LeetCode Binary Tree Level Order Traversal II(easy)[二叉树层次遍历 广度搜索 队列]
- Leetcode 107. Binary Tree Level Order Traversal II 二叉树层次遍历2 解题报告
- Leetcode#107. Binary Tree Level Order Traversal II (queue二叉树层次遍历)
- LeetCode OJ 之 Binary Tree Level Order Traversal II （二叉树的层次遍历-二）
- LeetCode | Binary Tree Level Order Traversal II（二叉树层序遍历II）
- 【LeetCode-面试算法经典-Java实现】【103-Binary Tree Zigzag Level Order Traversal（二叉树分层Z字形遍历）】
- 107. Binary Tree Level Order Traversal II （二叉树由底向上层次遍历）
- leetcode---binary-tree-level-order-traversal-ii---树层次遍历
- LeetCode | Binary Tree Level Order Traversal（二叉树层序遍历）
- [LeetCode]107. Binary Tree Level Order Traversal II--二叉树层序遍历2
- leetCode 107.Binary Tree Level Order Traversal II （二叉树水平序）
- leetCode解题报告之Binary Tree Level Order Traversal II,I(二叉树层次遍历)
- LeetCode 102. Binary Tree Level Order Traversal（二叉树分层遍历）
- LeetCode 103. Binary Tree Zigzag Level Order Traversal（二叉树之字形遍历）
- LeetCode 104. Maximum Depth of Binary Tree（二叉树高度）
- LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal（从前序遍历和中序遍历构造二叉树）
- LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal（根据中序遍历和后序遍历构造二叉树）
- LeetCode 107. Binary Tree Level Order Traversal II（二叉树分层遍历）
- LeetCode 108. Convert Sorted Array to Binary Search Tree（数组转换为二叉搜索树）
- LeetCode 109. Convert Sorted List to Binary Search Tree（链表到二叉搜索树）
- leetcode #24 in cpp
- Leetcode 133. Clone Graph & 138. Copy List with Random Pointer
- LeetCode 110. Balanced Binary Tree（平衡二叉树）
- LeetCode 111. Minimum Depth of Binary Tree（二叉树最小深度）
- LeetCode 112. Path Sum（路径和）
- 软件架构设计原则和模式（上）：分层架构设计
