107. Binary Tree Level Order Traversal II

MAGDB

于 2019-08-19 21:26:05 发布

阅读量94

点赞数

分类专栏： Leetcode 文章标签： leetcode 编程 tree

本文链接：https://blog.csdn.net/magicdoubi/article/details/99657803

版权

Leetcode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

原题

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

return its bottom-up level order traversal as:

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

翻译

给你一个二叉树, 返回其节点值的自下而上级别顺序遍历 (就是从左到右, 从叶到根一层一层的遍历).

例:
给定一个二叉树 [3,9,20,null,null,15,7],

返回的从底到顶一层层遍历就是:

[
  [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) {}
 * };
 */
 //C++程序 迭代
class Solution {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {  
        vector<vector<int>> returnVertor;
        if(root==NULL)return returnVertor;
        vector<int> ilist = {root->val};
        returnVertor.push_back(ilist);
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty())
        {
            int len = q.size();
            vector<int> temp;
            for(int i=0;i<len;++i)
            {
                TreeNode* tempNode = q.front();
                q.pop();
                
                if(tempNode->left)
                {
                    q.push(tempNode->left);
                    temp.push_back(tempNode->left->val);
                }
                if(tempNode->right)
                {
                    q.push(tempNode->right);
                    temp.push_back(tempNode->right->val);
                }
            }
            if(!temp.empty())returnVertor.insert(returnVertor.begin(),temp);
        }
        return returnVertor;
    }
};

在这里插入图片描述