剑指Offer(牛客网)-序列化二叉树

最新推荐文章于 2021-06-03 20:51:36 发布

晨初听雨

最新推荐文章于 2021-06-03 20:51:36 发布

阅读量221

点赞数 1

分类专栏：剑指Offer(牛客网) 文章标签：序列化二叉树剑指Offer(牛客网)-序列化二叉树剑指Offer序列化二叉树剑指Offer 牛客网

本文链接：https://blog.csdn.net/qq_39241239/article/details/97328740

版权

剑指Offer(牛客网) 专栏收录该内容

61 篇文章 2 订阅

订阅专栏

题目来源：

https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=4&rp=3&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking

题目描述：

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

代码如下：

/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

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

    }

}
*/
public class Solution {
    private int index = -1;

    String Serialize(TreeNode root) {
        StringBuffer sb = new StringBuffer();
        if (root == null) {
            sb.append("#,");
            return sb.toString();
        }
        sb.append(root.val + ",");
        sb.append(Serialize(root.left));
        sb.append(Serialize(root.right));
        return sb.toString();
    }

    TreeNode Deserialize(String str) {
        index++;
        String[] strArray = str.split(",");
        TreeNode node = null;
        if (!strArray[index].equals("#")) {
            node = new TreeNode(Integer.valueOf(strArray[index]));
            node.left = Deserialize(str);
            node.right = Deserialize(str);
        }
        return node;
    }
}