[剑指offer]序列化二叉树

题目描述

请实现两个函数，分别用来序列化和反序列化二叉树

二叉树的序列化是指：把一棵二叉树按照某种遍历方式的结果以某种格式保存为字符串，从而使得内存中建立起来的二叉树可以持久保存。序列化可以基于先序、中序、后序、层序的二叉树遍历方式来进行修改，序列化的结果是一个字符串，序列化时通过某种符号表示空节点（#），以！表示一个结点值的结束（value!）。

二叉树的反序列化是指：根据某种遍历顺序得到的序列化字符串结果str，重构二叉树。

题目连接：

https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

package com.sunshine.OFFER66_SECOND;

import org.junit.Test;

import java.util.ArrayList;

public class A61_SerializeDeserialize {


    @Test
    public void test() {
        TreeNode n1 = new TreeNode(1);
        TreeNode n2 = new TreeNode(2);
        TreeNode n3 = new TreeNode(3);
        TreeNode n4 = new TreeNode(4);
        TreeNode n5 = new TreeNode(5);
        TreeNode n6 = new TreeNode(6);
//        TreeNode n7 = new TreeNode(7);
        n1.left = n2;
        n1.right = n3;
//        n2.left = n4;
        n2.right = n5;
        n3.left = n6;
//        n3.right = n7;
        String serialize = Serialize(n1);
        System.out.println(serialize);


        TreeNode deserialize = Deserialize(serialize);
        TreeUtility.printTreeOfLine(deserialize);
    }

    String ans = "";
    String Serialize(TreeNode root) {
        if (null == root) {
            ans += "#!";
            return ans;
        }
        ans += root.val + "!";
        Serialize(root.left);
        Serialize(root.right);
        return ans;
    }
    int pos = 0;
    TreeNode Deserialize(String str) {
        String[] split = str.split("!");
        if(pos >= split.length){
            return null;
        }
        if (split[pos].equals("#")) {
            return null;
        }
        TreeNode node = new TreeNode(Integer.parseInt(split[pos]));
        pos++;
        node.left = Deserialize(str);
        pos ++;
        node.right = Deserialize(str);
        return node;
    }

}

来源：https://www.cnblogs.com/MoonBeautiful/p/11670731.html

标签

序列化

string

serialize