关于层次遍历的应用之往完全二叉树添加节点和获取每层最大值及二叉树的序列化和反序列化

前言

层次遍历是二叉树遍历的一种，求树宽等等应用都需要层次遍历作为基础。

一、案例

1、往完全二叉树添加节点

2、获取每层最大值

二、题解

1、层次遍历

package com.xhu.offer.offerII;

import java.text.BreakIterator;
import java.util.LinkedList;
import java.util.Queue;

//往完全二叉树添加节点
public class CBTInserter {
    //类似层次遍历，需要队列解决
    TreeNode root;
    Queue<TreeNode> queue;

    public CBTInserter(TreeNode root) {
        queue = new LinkedList<>();
        this.root = root;
        order(root);
    }

    //将元素添加到队列中
    private void order(TreeNode root) {
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(root);

        while (!q.isEmpty()) {
            TreeNode p = q.poll();
            if (p.left != null) {
                q.offer(p.left);
            }
            if (p.right != null) {
                q.offer(p.right);
            }
            if (p.left == null || p.right == null) queue.offer(p);
        }

    }

    public int insert(int v) {
        //取出队首节点，返回其val，将v进入队列。如果队首节点左子树不为空，要将队首移除。
        TreeNode p = queue.peek();
        int res = p.val;
        TreeNode node = new TreeNode(v, null, null);
        queue.offer(node);

        if (p.left == null) {
            p.left = node;
            return res;
        }
        p.right = node;
        return queue.poll().val;
    }

    public TreeNode get_root() {
        return this.root;
    }

    // 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;
        }
    }

}

2、层次遍历+双队列

package com.xhu.offer.offerII;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

//二叉树每层的最大值
public class LargestValues {
    //总结：细节没考虑周全时，这是一种正常情况，需要你有很强的排错能力，不断理清逻辑的耐心。
    public List<Integer> largestValues(TreeNode root) {
        List<Integer> res = new ArrayList<>();

        if (root == null) return res;
        //层次遍历+双队列来做到分层
        Queue<TreeNode> q1 = new LinkedList<>();
        Queue<TreeNode> q2 = new LinkedList<>();
        q1.add(root);
        int max = q1.peek().val;
        while (!q1.isEmpty()) {
            TreeNode r = q1.poll();

            if (r.left != null) q2.offer(r.left);
            if (r.right != null) q2.offer(r.right);

            max = max < r.val ? r.val : max;
            if (q1.isEmpty() && !q2.isEmpty()) {
                //交换队列
                Queue<TreeNode> t = q1;
                q1 = q2;
                q2 = t;
                //添加最大值
                res.add(max);
                //重新取max
                max = q1.peek().val;
            }

        }
        res.add(max);
        return res;
    }

    // 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;
        }
    }
}

总结

1）细节没考虑周全时，这是一种正常情况，需要你有很强的排错能力，不断理清逻辑的耐心。

参考文献

[1] LeetCode 往完全二叉树添加节点
[2] LeetCode 获取每层最大值

附加

二叉树的序列化和反序列化也可以用层序遍历很easy的解决。

package com.xhu.offer.offerII;

import java.util.LinkedList;
import java.util.Queue;

//序列化与反序列化二叉树
public class Codec {
    //层次遍历
    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        if (root == null) return null;

        StringBuilder sb = new StringBuilder();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        sb.append(root.val).append(' ');
        while (!queue.isEmpty()) {
            TreeNode node = queue.poll();
            if (node.left != null) {
                queue.offer(node.left);
                sb.append(node.left.val).append(' ');
            } else sb.append("null ");
            if (node.right != null) {
                queue.offer(node.right);
                sb.append(node.right.val).append(' ');
            } else sb.append("null ");
        }
        return sb.toString().trim();
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        if (data == null) return null;

        String[] strs = data.split(" ");
        Queue<TreeNode> queue = new LinkedList<>();
        TreeNode root = new TreeNode(Integer.parseInt(strs[0]));
        queue.offer(root);
        int count = 1;
        while (!queue.isEmpty()) {
            TreeNode node = queue.poll();
            String s1 = strs[count++], s2 = strs[count++];
            if ("null".equals(s1)) node.left = null;
            else {
                TreeNode left = new TreeNode(Integer.parseInt(s1));
                node.left = left;
                queue.offer(left);
            }
            if ("null".equals(s2)) node.right = null;
            else {
                TreeNode right = new TreeNode(Integer.parseInt(s2));
                node.right = right;
                queue.offer(right);
            }
        }
        return root;
    }

    // Definition for a binary tree node.
    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }
}