层次&zigzag遍历二叉树
dfs:
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if (root == null) return res;
dfs(root, res, 0);
return res;
}
private void dfs(TreeNode root, List<List<Integer>> res, int depth) {
if (root == null) return;
if (res.size() < depth + 1) res.add(new ArrayList<>());
if (depth % 2 == 0) {
res.get(depth).add(root.val);
} else {
res.get(depth).add(0, root.val);
}
dfs(root.left, res, depth + 1);
dfs(root.right, res, depth + 1);
}
bfs:
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> res = new LinkedList<>();
if (root == null) return res;
Queue<TreeNode> q = new LinkedList<>();
q.add(root);
int depth = 0;
while (!q.isEmpty()) {
int size = q.size();
List<Integer> tmp = new LinkedList<>();
for (int i = 0; i < size; i++) {
TreeNode poll = q.poll();
if (depth % 2 == 0) tmp.add(poll.val);
else tmp.add(0, poll.val);
if (poll.left != null) q.add(poll.left);
if (poll.right != null) q.add(poll.right);
}
res.add(tmp);
depth++;
}
return res;
}