N叉树如何通过二叉树来序列化、并完成反序列化

解题思路

多叉树转二叉树是要思考,如何将多叉树的每个节点都转到二叉树的节点上,且不会产生歧义,就是每个节点都能一眼看出他原本的位置.
方法:子节点的第一节点放在头节点的左节点上没然后依次放在右节点上.画个图帮助理解.

2 3 4 三个节点是1 这个节点的子节点,第一个子节点2 放在1 的左节点,剩下的依次都放右节点, 2 3 4的子节点也是这个规则 依次放下去.

多叉树和二叉树的代码定义

  /**
     * 多叉树
     */
    public class Node{
        public int val;
        public List<Node> children;

        public Node(int val) {
            this.val = val;
        }

        public Node(int val, List<Node> children) {
            this.val = val;
            this.children = children;
        }
    }


    /**
     * 二叉树
     */
    public class TreeNode{
        public int val;
        public TreeNode left;
        public TreeNode right;

        public TreeNode(int val) {
            this.val = val;
        }
    }

序列化

 public static TreeNode encode(Node node){
        if (null == node){
            return null;
        }
        TreeNode head = new TreeNode(node.val);
        head.left = en(node.children);
        return head;
    }

    public static TreeNode en(List<Node>children){
        if (null == children || children.size() == 0){
            return null;
        }
        TreeNode cur = null;
        TreeNode left = null;
        for (Node child : children){
            TreeNode treeNode = new TreeNode(child.val);
            if (left == null){
                left = treeNode;
            }else{
                cur.right = treeNode;
            }
            cur = treeNode;
            cur.left = en(child.children);
        }
        return left;
    }

反序列化

 public static Node decode(TreeNode head){
        if (null == head){
            return null;
        }
        return new Node(head.val,de(head.left));
    }

    public static List<Node> de(TreeNode left){
        ArrayList<Node> nodes = new ArrayList<>();
        while (left != null){
            Node cur = new Node(left.val,de(left.left));
            nodes.add(cur);
            left = left.right;
        }
        return nodes;
    }

leetcode 原题链接

leetcode原题链接