Leetcode--Binary Tree Level Order Traversal II

最新推荐文章于 2014-11-13 12:29:48 发布

yskyj

最新推荐文章于 2014-11-13 12:29:48 发布

阅读量465

点赞数

分类专栏： Leetcode 文章标签： leetcode Binary Tree Level Or

本文链接：https://blog.csdn.net/yskyj/article/details/40452037

版权

Leetcode 专栏收录该内容

75 篇文章 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,#,#,15,7},

return its bottom-up level order traversal as:

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

Hide Tags

Tree Breadth-first Search

/**
 * Definition for binary tree
 * 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) {
        vector<vector<int>> res;
        if(root==NULL)
            return res;
            
        deque<TreeNode*> que;
        que.push_back(root);
        while(!que.empty())
        {
            vector<int> temp;
            deque<TreeNode*> cur;
            while(!que.empty())
            {
                temp.push_back(que.front()->val);
                if(que.front()->left!=NULL)
                    cur.push_back(que.front()->left);
                if(que.front()->right!=NULL)
                    cur.push_back(que.front()->right);
                que.pop_front();
            }
            res.insert(res.begin(),temp);//问题一中的后插，改成头插法
            que.assign(cur.begin(),cur.end());
        }
        
        return res;
    }
};