二叉树的层次遍历
给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
挺简单一题。。自己写的代码复杂一点,都贴上去吧
vector<vector<int>> levelorder(treenode* root) {
vector<vector<int>> vec;
if (!root) return vec;
int front = 0, rear = 0;
int p = 0;
vector<int> temp;
vector<treenode*> queue;
temp.push_back(root->val);
vec.push_back(temp);
temp.clear();
queue.push_back(root);
while (rear >= front) {
treenode* node = queue[front];
if (node->left) {
queue.push_back(node->left);
temp.push_back(node->left->val);
rear++;
}
if (node->right) {
queue.push_back(node->right);
temp.push_back(node->right->val);
rear++;
}
if (front == p && temp.size() != 0) {
vec.push_back(temp);
temp.clear();
p = rear;
}
front++;
}
return vec;
}
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
if (!root) return res;
queue<TreeNode*> que;
vector<int> temp;
que.push(root);
temp.push_back(root->val);
res.push_back(temp);
temp.clear();
while (que.size() > 0) {
int wide = que.size();
for (int i = 0; i < wide; i++) {
TreeNode *node = que.front();
que.pop();
if (node->left) {
temp.push_back(node->left->val);
que.push(node->left);
}
if (node->right) {
temp.push_back(node->right->val);
que.push(node->right);
}
}
if(temp.size()!=0) res.push_back(temp);
temp.clear();
}
return res;
}