[LeetCode] Binary Tree Level Order Traversal II
Well, I do not see what this problem is for. The same code of Binary Tree Level Order Traversal can be used here. The only difference is that we should reverse the result before we return.
Again, both BFS and DFS solutions.
BFS:
1 vector<vector<int> > levelOrderBottom(TreeNode *root) { 2 vector<vector<int> > levels; 3 if(!root) return levels; 4 queue<TreeNode*> toVisit; 5 toVisit.push(root); 6 int numLevelNodes = 1; 7 while(!toVisit.empty()) { 8 vector<int> level; 9 for(int i = 0; i < numLevelNodes; i++) { 10 TreeNode *node = toVisit.front(); 11 toVisit.pop(); 12 level.push_back(node -> val); 13 if(node -> left) toVisit.push(node -> left); 14 if(node -> right) toVisit.push(node -> right); 15 } 16 if (!level.empty()) levels.push_back(level); 17 numLevelNodes = toVisit.size(); 18 } 19 reverse(levels.begin(), levels.end()); 20 return levels; 21 }
DFS:
1 vector<vector<int>> levelOrderBottom(TreeNode *root) { 2 vector<vector<int>> levels; 3 if(!root) return levels; 4 int curLevel = 1; 5 bool nextLevel = true; 6 while(nextLevel) { 7 vector<int> level; 8 nextLevel = false; 9 levelTraverse(root, curLevel, nextLevel, level); 10 levels.push_back(level); 11 curLevel++; 12 } 13 reverse(levels.begin(), levels.end()); 14 return levels; 15 } 16 void levelTraverse(TreeNode* node, int curLevel, bool& nextLevel, vector<int>& level) { 17 if(!node) return; 18 if(curLevel == 1) { 19 level.push_back(node -> val); 20 if(node -> left || node -> right) nextLevel = true; 21 } 22 else { 23 levelTraverse(node -> left, curLevel - 1, nextLevel, level); 24 levelTraverse(node -> right, curLevel - 1, nextLevel, level); 25 } 26 }
【推荐】还在用 ECharts 开发大屏?试试这款永久免费的开源 BI 工具!
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· .NET 原生驾驭 AI 新基建实战系列:向量数据库的应用与畅想
· 从问题排查到源码分析:ActiveMQ消费端频繁日志刷屏的秘密
· 一次Java后端服务间歇性响应慢的问题排查记录
· dotnet 源代码生成器分析器入门
· ASP.NET Core 模型验证消息的本地化新姿势
· 从零开始开发一个 MCP Server!
· ThreeJs-16智慧城市项目(重磅以及未来发展ai)
· .NET 原生驾驭 AI 新基建实战系列(一):向量数据库的应用与畅想
· Ai满嘴顺口溜,想考研?浪费我几个小时
· Browser-use 详细介绍&使用文档