[LeetCode]Binary Tree Level Order Traversal II

最新推荐文章于 2021-11-18 16:57:58 发布

CiaoLiang

最新推荐文章于 2021-11-18 16:57:58 发布

阅读量349

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/CiaoLiang/article/details/50427586

LeetCode 专栏收录该内容

149 篇文章

订阅专栏

本文介绍了一种从叶节点到根节点的层次遍历二叉树的方法，并提供了一个具体的C++实现示例。该算法首先计算二叉树的深度，然后通过递归方式收集每个层级的节点值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

return its bottom-up level order traversal as:

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

/**
 * 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 {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        int d = depth(root);
        vector<vector<int>> ret(d);
        levelOrder(ret, root, d-1);
        return ret;
    }
    int depth(TreeNode *root) {
        if (!root) return 0;
        return max(depth(root->left),depth(root->right))+1;
    }
    
    void levelOrder(vector<vector<int>> &ans, TreeNode *node, int level) {
        if (!node) return;
        ans[level].push_back(node->val);
        levelOrder(ans,node->left,level-1);
        levelOrder(ans,node->right,level-1);
    }
};