Binary Tree Level Order Traversal
来源:互联网 发布:软件杯比赛规则 编辑:程序博客网 时间:2024/04/30 11:31
/** * 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> > res; vector<vector<int> > levelOrder(TreeNode *root) { queue<TreeNode*> mq1; queue<TreeNode*> mq2; if(root==NULL) { return res; } mq1.push(root); while((!mq1.empty())||(!mq2.empty())) { if(mq1.empty()) { //pop mq2 and fill mq1 vector<int> tmp; while(!mq2.empty()) { TreeNode* nn=mq2.front(); mq2.pop(); tmp.push_back(nn->val); if(nn->left!=NULL) { mq1.push(nn->left); } if(nn->right!=NULL) { mq1.push(nn->right); } } res.push_back(tmp); } else { //pop mq1 and fill mq2 vector<int> tmp; while(!mq1.empty()) { TreeNode* nn=mq1.front(); mq1.pop(); tmp.push_back(nn->val); if(nn->left!=NULL) { mq2.push(nn->left); } if(nn->right!=NULL) { mq2.push(nn->right); } } res.push_back(tmp); } } return res; }};
0 0
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- 决策树ID3算法
- Flatten Binary Tree to Linked List Leetcode Python
- 交易偏见--《别做正常的傻瓜》摘记2
- 关于syslogd与klogd
- C++ 语言知识汇集
- Binary Tree Level Order Traversal
- CodeForces - 348A
- 最简单的栈问题
- Jackson实现Object对象与Json字符串的互转
- WOJ-1100
- java多线程总结
- android中listView下拉刷新
- Android Studio 离线安装 Gradle 的方法
- 安装配置Hadoop的各个配置文件修改的地方以及修改的内容