题目
请实现一个函数按照之字形顺序打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右到左的顺序打印,第三行再按照从左到右的顺序打印,其他行以此类推。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
返回其层次遍历结果:
[
[3],
[20,9],
[15,7]
]
提示:
节点总数 <= 1000
代码
Python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
# 思路:
# BFS+deque,奇偶层分别入队尾,队头
# 复杂度:
# O(N)
class Solution:
def levelOrder(self, root: TreeNode) -> List[List[int]]:
if not root: return []
res, Q = [], collections.deque()
Q.append(root) # 根入队
while Q:
tmp = [] # 暂存列表
# 打印奇数层
for _ in range(len(Q)):
# 从左向右打印
node = Q.popleft()
tmp.append(node.val)
# 先左子树后右子树
if node.left: Q.append(node.left)
if node.right: Q.append(node.right)
res.append(tmp)
if not Q: break # 若为空则提前跳出
# 打印偶数层
tmp = []
for _ in range(len(Q)):
# 从右向左打印
node = Q.pop()
tmp.append(node.val)
# 先右子树后左子树
if node.right: Q.appendleft(node.right)
if node.left: Q.appendleft(node.left)
res.append(tmp)
return res
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;
deque<TreeNode*> Q;
Q.push_back(root);
while(!Q.empty()){
vector<int> tmp;
for(int i = Q.size(); i > 0; i--){
TreeNode* node = Q.front();
Q.pop_front();
tmp.push_back(node->val);
if(node->left) Q.push_back(node->left);
if(node->right) Q.push_back(node->right);
}
res.push_back(tmp);
tmp.clear();
if(Q.empty()) break;
for(int i = Q.size(); i > 0; i--){
TreeNode* node = Q.back();
Q.pop_back();
tmp.push_back(node->val);
if(node->right) Q.push_front(node->right);
if(node->left) Q.push_front(node->left);
}
res.push_back(tmp);
}
return res;
}
};