技术交流可以加:
本人微信:xcg852390212
本人qq:852390212
学习交流qq群1(已满): 962535112
学习交流qq群2: 780902027
二叉树的层次遍历
给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
例如:
给定二叉树: [3,9,20,null,null,15,7]
,
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
解答
考察二叉树的层序遍历,利用队列结构queue
实现。层序遍历的过程中需要将每层的元素分开存放,定义两个指针pre
和next
,pre
指向当前层的最后一个节点,next
指向下一层的最后一个节点,当遍历到的当前结点cur == pre
时,令pre = next
,next
一直更新,它指向已入队列的最后一个节点。
C++代码
/**
* Definition for a binary tree node.
* 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 >> res;
if(!root)
return res;
vector<int> vec;
queue<TreeNode*> que;
TreeNode* pre = root;
TreeNode* next = nullptr;
que.push(root);
while(!que.empty())
{
TreeNode* cur = que.front();
que.pop();
vec.push_back(cur->val);
if(cur->left)
{
que.push(cur->left);
next = cur->left;
}
if(cur->right)
{
que.push(cur->right);
next = cur->right;
}
if(cur == pre)
{
res.push_back(vec);
vec.clear();
pre = next;
}
}
return res;
}
};
Python代码
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def levelOrder(self, root: TreeNode) -> List[List[int]]:
if root is None:
return []
res = []
que = []
vec = []
pre = root
nex = None
que.append(root)
while len(que) > 0:
cur = que.pop(0)
vec.append(cur.val)
if cur.left:
que.append(cur.left)
nex = cur.left
if cur.right:
que.append(cur.right)
nex = cur.right
if cur == pre:
pre = nex
res.append(vec)
vec = []
return res