二叉树的序列化和反序列化

二叉树的序列化和反序列化

private static class BinaryTreeNode {
        private int val;
        private BinaryTreeNode left;
        private BinaryTreeNode right;

        public BinaryTreeNode() {
        }

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

        @Override
        public String toString() {
            return val + "";
        }
    }

    public static void serialize(BinaryTreeNode root, List<Integer> result) {

        List<BinaryTreeNode> list = new LinkedList<>();
        list.add(root);
        BinaryTreeNode node;
        while (list.size() > 0) {
            node = list.remove(0);
            if (node == null) {
                result.add(null);
            }else {
                result.add(node.val);
                list.add(node.left);
                list.add(node.right);
            }
        }
    }

    public static BinaryTreeNode deserialize(List<Integer> result, int index) {

        if (result.size() < 1 || index < 0 || result.size() <= index || result.get(index) == null) {
            return null;
        }

        BinaryTreeNode root = new BinaryTreeNode(result.get(index));
        root.left = deserialize(result, index * 2 + 1);
        root.right = deserialize(result, index * 2 + 2);
        return root;

    }