题目链接:https://oj.leetcode.com/problems/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] ]
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
解题思路:标准的分层搜索树,比较简单。采用Deque进行存储,遇见节点就存入左右支点。不断存入,不断取出。再使用一个nowNum,nextNum进行计数,再矩阵输出。
/**
* 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> > levelOrder(TreeNode *root) {
vector<vector<int> > s;
vector<int> t;
int nowNum = 0; //nowNum
int nextNum = 0; //nextNum
if (root == NULL) return s;
queue<TreeNode *> q;
q.push(root);
nowNum++;
while(!q.empty()) {
TreeNode *node = q.front();
q.pop();
nowNum--;
t.push_back(node->val);
if (node->left != NULL) {
q.push(node->left);
nextNum++;
}
if (node->right != NULL) {
q.push(node->right);
nextNum++;
}
if (nowNum == 0) {
s.push_back(t);
nowNum = nextNum;
nextNum = 0;
t.clear();
}
}
return s;
}
};
转载请注明作者:vanish_dust