LeetCode之Binary Tree Level Order Traversal II

最新推荐文章于 2024-02-12 01:19:39 发布

wteo

最新推荐文章于 2024-02-12 01:19:39 发布

阅读量904

点赞数

分类专栏： LeetCode leetcode

本文链接：https://blog.csdn.net/smileteo/article/details/22983237

版权

LeetCode 同时被 2 个专栏收录

55 篇文章 0 订阅

订阅专栏

leetcode

46 篇文章 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],
]

与Binary Tree Level Order Traversal一样只不过在程序最后加上一个reserve函数

/**
 * 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>>  rst;
       BFS(root,0,rst);
       reverse(rst.begin(),rst.end());
       return rst;
    }
    
     void BFS(TreeNode *root, int level, vector<vector<int> > &rst) {
        if(!root)return ;
        if(level>=rst.size()) rst.push_back(vector<int>());
        rst[level].push_back(root->val);
        BFS(root->left,level+1,rst);
        BFS(root->right,level+1,rst);
    }
********************************************************************/

    vector<vector<int> > levelOrderBottom(TreeNode *root) {
      vector<vector<int>> rst;
		 queue<TreeNode*> currentLevel, nextLevel;
		 currentLevel.push(root);
		 vector<int> ivec;
		 
		 if (!root) return rst;
		 while (!currentLevel.empty()) {
			 TreeNode *currNode = currentLevel.front();
			 currentLevel.pop();
			 if (currNode) {
				 ivec.push_back(currNode->val);
				 if(currNode->left)    nextLevel.push(currNode->left);
				 if(currNode->right)   nextLevel.push(currNode->right);
			 }
			 if (currentLevel.empty()) {
				 rst.push_back(ivec);
				 ivec.clear();
				 swap(currentLevel, nextLevel);
			 }
		 }
		 reverse(rst.begin(),rst.end());
		 return rst;
    }

};