Loading [MathJax]/jax/input/TeX/config.js
首页
学习
活动
专区
圈层
工具
发布
首页
学习
活动
专区
圈层
工具
MCP广场
社区首页 >专栏 >LeetCode 0107 - Binary Tree Level Order Traversal II

LeetCode 0107 - Binary Tree Level Order Traversal II

作者头像
Reck Zhang
发布于 2021-08-11 02:52:47
发布于 2021-08-11 02:52:47
16400
代码可运行
举报
文章被收录于专栏:Reck ZhangReck Zhang
运行总次数:0
代码可运行

Binary Tree Level Order Traversal II

Desicription

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],

代码语言:javascript
代码运行次数:0
运行
AI代码解释
复制
  3
 / \
9  20
  /  \
 15   7

return its bottom-up level order traversal as:

代码语言:javascript
代码运行次数:0
运行
AI代码解释
复制
[
  [15,7],
  [9,20],
  [3]
]

Solution

代码语言:javascript
代码运行次数:0
运行
AI代码解释
复制
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    vector<vector<int>> res;
    void searchTree(TreeNode* root, int level) {
        if(!root)
            return ;
        if(level == res.size())
            res.push_back(vector<int>());
        res[level].push_back(root->val);
        searchTree(root->left, level+1);
        searchTree(root->right, level+1);
    }
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        searchTree(root, 0);
        for(int i = 0, j = res.size()-1; i <= j; i++, j--)
            swap(res[i], res[j]);
        return res;
    }
};
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2017-12-17,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
暂无评论
推荐阅读
编辑精选文章
换一批
LeetCode 0102 - Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
Reck Zhang
2021/08/11
1980
【leetcode】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).
阳光岛主
2019/02/19
3700
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 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 i
triplebee
2018/01/12
5210
LeetCode笔记:107. Binary Tree Level Order Traversal II
image.png return its bottom-up level order traversal as: [   [15,7],   [9,20],   [3] ]
Cloudox
2021/11/23
1880
LeetCode笔记:107. Binary Tree Level Order Traversal II
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 left to right, level by level from leaf to root).
ShenduCC
2018/07/24
2870
LeetCode 0103 - Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).
Reck Zhang
2021/08/11
1840
leetcode: 107. Binary Tree Level Order Traversal II
Difficulty Easy. Problem 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
JNingWei
2019/02/25
3870
Tree - 107. Binary Tree Level Order Traversal II
107. Binary Tree Level Order Traversal II
ppxai
2020/09/23
2810
LeetCode 102 & 103 &107 & 637. Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
大学里的混子
2018/10/31
3150
Q107 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,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its bo
echobingo
2018/04/25
3890
leetcode 102 Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
流川疯
2019/01/18
3810
LeetCode 103 Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
ShenduCC
2018/07/24
2840
Leetcode 102 Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its level order traversal as:
triplebee
2018/01/12
5110
LeetCode 102. Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its level order traversal as: [ [
ShenduCC
2018/06/21
3000
【leetcode】Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
阳光岛主
2019/02/19
3420
Leetcode: Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
卡尔曼和玻尔兹曼谁曼
2019/01/22
3120
LeetCode笔记:102. Binary Tree Level Order Traversal
image.png return its level order traversal as: [   [3],   [9,20],   [15,7] ]
Cloudox
2021/11/23
2270
LeetCode笔记:102. Binary Tree Level Order Traversal
Leetcode 107. Binary Tree Level Order Traversal II
版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://blog.csdn.net/Quincuntial/article/details/82777263
Tyan
2019/05/25
3350
【leetcode】Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
阳光岛主
2019/02/19
3890
Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
Tyan
2019/05/25
3120
相关推荐
LeetCode 0102 - Binary Tree Level Order Traversal
更多 >
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档
本文部分代码块支持一键运行,欢迎体验
本文部分代码块支持一键运行,欢迎体验