Binary Tree Level Order Traversal II 二叉树的反向层序遍历
来源:互联网 发布:淘宝联盟下单没有佣金 编辑:程序博客网 时间:2024/05/18 12:30
/**
* 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>> ret;
if(root==NULL) return ret;
vector<int> tmp;
queue<TreeNode*> q;
q.push(root);
int level=0;
int count=1;
while(!q.empty())
{
level=0;
tmp.clear();
for(int i=0;i<count;i++)
{
root=q.front();
q.pop();
tmp.push_back(root->val);
if(root->left!=NULL)
{
q.push(root->left);
level++;
}
if(root->right!=NULL)
{
q.push(root->right);
level++;
}
}
count=level;
ret.push_back(tmp);
}
reverse(ret.begin(),ret.end());
return ret;
}
};
* 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>> ret;
if(root==NULL) return ret;
vector<int> tmp;
queue<TreeNode*> q;
q.push(root);
int level=0;
int count=1;
while(!q.empty())
{
level=0;
tmp.clear();
for(int i=0;i<count;i++)
{
root=q.front();
q.pop();
tmp.push_back(root->val);
if(root->left!=NULL)
{
q.push(root->left);
level++;
}
if(root->right!=NULL)
{
q.push(root->right);
level++;
}
}
count=level;
ret.push_back(tmp);
}
reverse(ret.begin(),ret.end());
return ret;
}
};
0 0
- Binary Tree Level Order Traversal II 二叉树的反向层序遍历
- 二叉树的层序遍历 改进版 Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal II 二叉树的同层遍历系列2
- 004-107-Binary Tree Level Order Traversal II 层序遍历二叉树之二
- 【leetcode 层序遍历】Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal 二叉树的层序遍历
- Binary Tree Level Order Traversal 二叉树的层序遍历
- Binary Tree Level Order Traversal II 从下向上按层遍历二叉树
- 70.Binary Tree Level Order Traversal II-二叉树的层次遍历 II(中等题)
- [Lintcode]Binary Tree Level Order Traversal II 二叉树的层次遍历 II
- Binary Tree Level Order Traversal II 二叉树按层遍历(反向输出)@LeetCode
- 【LeetCode笔记】Binary Tree Level Order Traversal II 二叉树按层遍历,反向输出
- LeetCode OJ 之 Binary Tree Level Order Traversal II (二叉树的层次遍历-二)
- 5.1.5—二叉树的遍历—Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal 二叉树的同层遍历
- Binary Tree Level Order Traversal:层次遍历二叉树,并返回每层的数值
- 【LeetCode】Binary Tree Zigzag Level Order Traversal--- 层序遍历二叉树
- 003-102-Binary Tree Level Order Traversal 层序遍历二叉树
- zabbix proxy安装和配置
- stun
- CWnd与HWND的区别与转换
- 希尔排序
- Invalid escape sequence (valid ones are \b \t \n \f \r \" \' \\ )
- Binary Tree Level Order Traversal II 二叉树的反向层序遍历
- Java实现的几个常用排序算法详细解读
- make -j4
- ios 百度地图开发 奔溃原因可能之一
- Android开发之异步下载网络图片并显示到UI界面
- ajax 和 adodb.stream组件 上传本地文件
- 玻璃钢通风柜
- 注意Java代码的内存泄漏
- OpenGL与DirectX