发现这三题可以用一个模板,只需要做微调,大大减少记忆量
leetcode 都能通过,
Binary Tree Level Order Traversal
Binary Tree Level Order Traversal II Binary Tree Zigzag Level Order Traversal
Binary Tree Level Order Traversal
这是基本模板
public class BinaryTreeLevelOrderTraversal {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if (root == null) {
return res;
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while (!queue.isEmpty()) {
List<Integer> level = new ArrayList<Integer>();
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode cur = queue.remove();
level.add(cur.val);
if (cur.left != null) {
queue.add(cur.left);
}
if (cur.right != null) {
queue.add(cur.right);
}
}
res.add(level);
}
return res;
}
}
Binary Tree Level Order Traversal II
从前面插入新元素 add(0,val)
public class BinaryTreeLevelOrderTraversal2 {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if (root == null) {
return res;
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while (!queue.isEmpty()) {
List<Integer> level = new ArrayList<Integer>();
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode cur = queue.remove();
level.add(cur.val);
if (cur.left != null) {
queue.add(cur.left);
}
if (cur.right != null) {
queue.add(cur.right);
}
}
res.add(0, level);//微调在这里
}
return res;
}
}
[b]Binary Tree Zigzag Level Order Traversal
记录层数,能被2整除就从左到右排,在后面append新元素。直接add(),
不能被2整除就从右到坐排,从前面插入新元素 add(0,val)
*/
public class BinaryTreeZigzagLevelOrderTraversal {
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if (root == null) {
return res;
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
int n = 0;[b]//微调在这里
[/b]
while (!queue.isEmpty()) {
List<Integer> level = new ArrayList<Integer>();
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode cur = queue.remove();
if (n % 2 == 0) {[b]//微调在这里
[/b]
level.add(cur.val);
} else {
level.add(0, cur.val);
}
if (cur.left != null) {
queue.add(cur.left);
}
if (cur.right != null) {
queue.add(cur.right);
}
}
n++;[b]//微调在这里
[/b]
res.add(level);
}
return res;
}
}