102. Binary Tree Level Order Traversal
来源:互联网 发布:网络开盘抢房技巧 编辑:程序博客网 时间:2024/06/10 05:26
1、题目描述
二叉树的层次遍历。
2、思路
利用queue进行BFS。
3、代码
vector<vector<int>> levelOrder(TreeNode* root) { vector<vector<int>> ans; if(root==NULL) return ans; queue<TreeNode*>q; q.push(root); while(!q.empty()){ int l = q.size(); vector<int>v; for(int i=0;i<l;i++){ TreeNode* t = q.front(); q.pop(); v.push_back(t->val); if(t->left) q.push(t->left); if(t->right) q.push(t->right); } ans.push_back(v); } return ans; }
阅读全文
0 0
- LeetCode 102. Binary Tree Level Order Traversal
- [LeetCode]102.Binary Tree Level Order Traversal
- [Leetcode] 102. Binary Tree Level Order Traversal
- LeetCode --- 102. Binary Tree Level Order Traversal
- [leetcode] 102.Binary Tree Level Order Traversal
- 102.Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 【leetcode】102. Binary Tree Level Order Traversal
- 102.Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- Leetcode 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal LeetCode
- 102. Binary Tree Level Order Traversal
- [leetcode] 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 每周「Paper + Code」清单:句子嵌入,文本表示,图像风格转换
- 直播实录 | 基于生成模型的事件流研究 + NIPS 2017 论文解读
- JS相关实用Demo
- 函数
- PHP安装
- 102. Binary Tree Level Order Traversal
- java常用字节流总结
- 数据库概念辨析
- 动态规划经典案例
- CXF之webservice 使用 CXF 做 webservice 简单例子
- TabLayout +ViewPager+Fragment + RecycleView + webView加载本地html
- 接口文档
- 增删该查
- 查看事物码相关的数据对象