剑指offer-题62：序列化二叉树

向右看齐 2022-05-26 02:30 150阅读 0赞

## **题目描述** ##

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

实验平台：[牛客网][Link 1]

--------------------

## **解决思路：** ##

![这里写图片描述][70]  
![这里写图片描述][70 1]

java:

/* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */
    public class Solution { 
        int index = -1;
        // 序列化
        String Serialize(TreeNode root) {
            String str = "";
            if (root == null) {
                str = str + '$' + ',';
                return str;
            } else {
                str = str + root.val + ',';
                str = str + Serialize(root.left);
                str = str + Serialize(root.right);
            }
            return str;
        }
    
        TreeNode Deserialize(String str) {
            TreeNode root = null;
            if (str != null) {
                String[] strArray = str.split(",");
                if (strArray[0] != "$") {
                    root = Deserialize(strArray);
                } else {
                    return null;
                }
            }
            return root;
        }
    
        TreeNode Deserialize(String[] strArray) {
            index++;
            TreeNode node = null;
            if (!strArray[index].equals("$")) {
                node = new TreeNode(Integer.parseInt(strArray[index]));
                node.left = Deserialize(strArray);
                node.right = Deserialize(strArray);
            }
            return node;
        }
    }

python:

略

[Link 1]: https://www.nowcoder.com/ta/coding-interviews?page=1
[70]: /images/20220526/631b1dc7323344c3a731006d7971ddc7.png
[70 1]: /images/20220526/8f258be2cc9c465d9d7b8935b9080537.png