103. 二叉树的锯齿形层序遍历:
题目链接 :103. 二叉树的锯齿形层序遍历
题目:
给定一个二叉树,返回其节点值的锯齿形层序遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
思路:
1、BFS:
-
在102的基础上增加了层数值的判断:
-
奇数层自左向右遍历层值
-
偶数自右向左
AC代码:
- BFS
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> res=new ArrayList<>();
if(root==null)
{
return res;
}
Queue<TreeNode> qe=new ArrayDeque<>();
qe.add(root);
int depth=0;
while(!qe.isEmpty())
{
int n=qe.size();
List<Integer> ad=new ArrayList<>();
for(int i=0;i<n;i++)
{
TreeNode node=qe.poll();
if(depth%2==0) ad.add(node.val);
else ad.add(0,node.val);
if(node.left!=null)
{
qe.add(node.left);
}
if(node.right!=null)
{
qe.add(node.right);
}
}
res.add(ad);
depth++;
}
return res;
}
}
- DFS
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if(root != null){
dfs(res, root, 0);
}
return res;
}
private void dfs(List<List<Integer>> res, TreeNode node, int level){
if(res.size() - 1 < level){
res.add(new ArrayList<Integer>());
}
if(level%2==0)
res.get(level).add(node.val);
else
res.get(level).add(0,node.val);
if(node.left!=null){
dfs(res, node.left, level + 1);
}
if(node.right!=null){
dfs(res, node.right, level + 1);
}
}
}