目录结构
1.题目
请实现一个函数按照之字形顺序打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右到左的顺序打印,第三行再按照从左到右的顺序打印,其他行以此类推。
示例:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[20,9],
[15,7]
]
提示:
节点总数 <= 1000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2.题解
通过变量记录获取每层的节点个数(或者通过队列大小获取每层节点个数)按层输出即可,注意偶数层倒序。
public class Offer32_3 {
@Test
public void test() {
TreeNode root = new TreeNode(1, new TreeNode(2, new TreeNode(4), null),
new TreeNode(3, null, new TreeNode(5)));
System.out.println(levelOrder(root));
}
public List<List<Integer>> levelOrder(TreeNode root) {
if (root == null) {
return new ArrayList<>();
}
List<List<Integer>> resultList = new ArrayList<>();
Queue<TreeNode> queue = new ArrayDeque<>();
List<Integer> tmpList = new ArrayList<>();
queue.add(root);
int pre = 1, current = 0, level = 1;
while (!queue.isEmpty()) {
TreeNode tmp = queue.poll();
tmpList.add(tmp.val);
if (tmp.left != null) {
current++;
queue.add(tmp.left);
}
if (tmp.right != null) {
current++;
queue.add(tmp.right);
}
if (--pre == 0) {
if ((level++ & 1) == 0) {
Collections.reverse(tmpList);
}
resultList.add(tmpList);
tmpList = new ArrayList<>();
pre = current;
current = 0;
}
}
return resultList;
}
public List<List<Integer>> levelOrder1(TreeNode root) {
if (root == null) {
return new ArrayList<>();
}
List<List<Integer>> resultList = new ArrayList<>();
Queue<TreeNode> queue = new ArrayDeque<>();
List<Integer> tmpList = new ArrayList<>();
queue.add(root);
int level = 1;
while (!queue.isEmpty()) {
for (int i = queue.size(); i > 0; i--) {
TreeNode tmp = queue.poll();
tmpList.add(tmp.val);
if (tmp.left != null) {
queue.add(tmp.left);
}
if (tmp.right != null) {
queue.add(tmp.right);
}
}
if ((level++ & 1) == 0) {
Collections.reverse(tmpList);
}
resultList.add(tmpList);
tmpList = new ArrayList<>();
}
return resultList;
}
}
- 时间复杂度:
- 空间复杂度: