树的算法题

1、分层打印

维护当前层的节点数curLevelSize、下一层的节点数nextLevelSize。

1. N叉树的层序遍历 ，leetcode429；

class Solution {
    public List<List<Integer>> levelOrder(Node root) {      
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) return result;
        Queue<Node> queue = new LinkedList<>();
        queue.add(root);
        // 记录当前层的节点数
        int curLevelSize = 1;
        // 记录下一层的节点数
        int nextLevelSize = 0;
        while (!queue.isEmpty()) {
            List<Integer> level = new ArrayList<>();
     		// 这块儿不太一样
            for (int i = 0; i < curLevelSize; i++) {
                Node cur = queue.poll();
                level.add(cur.val);
                queue.addAll(cur.children);
                nextLevelSize += cur.children.size();
            }
            curLevelSize = nextLevelSize;
            nextLevelSize = 0;
            result.add(level);
        }
        return result;
    }
}

2. 之字形打印二叉树 ，leetcode103；

class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        if (root == null) {
            return new ArrayList<>();
        }
        List<List<Integer>> res = new ArrayList<>();
        Deque<TreeNode> deque = new LinkedList<>();
        deque.offerLast(root);

        int curLevelSize = 1;
        int nextLevelSize = 0;
        boolean flag = true; // 为true时左往右遍历，false时右往左遍历
        while (!deque.isEmpty()) {
            List<Integer> level = new ArrayList<>();
            for (int i = 0; i < curLevelSize; i++) {
                if (flag) {
                    TreeNode node = deque.pollFirst();
                    level.add(node.val);
                    if (node.left != null) {
                        deque.offerLast(node.left);
                        nextLevelSize++;
                    }
                    if (node.right != null) {
                        deque.offerLast(node.right);
                        nextLevelSize++;
                    }
                    
                } else {
                    TreeNode node = deque.pollLast();
                    level.add(node.val);
                    if (node.right != null) {
                        deque.offerFirst(node.right);
                        nextLevelSize++;
                    }
                    if (node.left != null) {
                        deque.offerFirst(node.left);
                        nextLevelSize++;
                    }
                }
            }
            res.add(level);
            flag = !flag;
            curLevelSize = nextLevelSize;
            nextLevelSize = 0;
        }
        return res;
    }
}

2、N叉树的前序遍历

诀窍：栈中存放未遍历的节点，保证下一个遍历的节点在栈顶！

class Solution {
    public List<Integer> preorder(Node root) {
        List<Integer> res = new ArrayList<>();
        Deque<Node> s = new LinkedList<>();
        if (root != null)
            s.addLast(root);
        while (!s.isEmpty()) {
            Node cur = s.pollLast();
            res.add(cur.val);
            for (int i = cur.children.size() - 1; i >= 0; --i)
                s.addLast(cur.children.get(i));
        }
        return res;
    }
}

3、N叉树的后序遍历

后序遍历的通用迭代诀窍：得到“中右左”的序列，然后reverse！

class Solution {
    public List<Integer> postorder(Node root) {
        List<Integer> res = new ArrayList<>();
        Deque<Node> s = new LinkedList<>();
        if (root != null)
            s.addLast(root);
        while (!s.isEmpty()) {
            Node cur = s.pollLast();
            res.add(cur.val);
            for (int i = 0; i < cur.children.size(); ++i)
                s.addLast(cur.children.get(i));
        }
        Collections.reverse(res);
        return res;
    }
}