首页 > 代码库 > 【LeetCode】Binary Tree Level Order Traversal
【LeetCode】Binary Tree Level Order Traversal
Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes‘ values. (ie, from left to right, level by level).
For example:
Given binary tree {3,9,20,#,#,15,7},
3 / 9 20 / 15 7
return its level order traversal as:
[ [3], [9,20], [15,7]]
层次遍历，同层装入vector。
可参照Binary Tree Zigzag Level Order Traversal。
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */struct Node{ TreeNode* tree; int level; Node(TreeNode* root, int l):tree(root), level(l){}};class Solution {public: vector<vector<int> > levelOrder(TreeNode *root) { vector<vector<int> > result; if(root == NULL) return result; int lastLevel = 0; vector<int> cur; queue<Node*> q; Node* rootNode = new Node(root, 0); q.push(rootNode); while(!q.empty()) { Node* front = q.front(); q.pop(); if(front->level > lastLevel) { result.push_back(cur); cur.clear(); lastLevel = front->level; } cur.push_back(front->tree->val); if(front->tree->left) { Node* leftNode = new Node(front->tree->left, front->level+1); q.push(leftNode); } if(front->tree->right) { Node* rightNode = new Node(front->tree->right, front->level+1); q.push(rightNode); } } //add last level result.push_back(cur); return result; }};
【LeetCode】Binary Tree Level Order Traversal
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。