序列化和反序列化二叉搜索树

序列化是将数据结构或对象转换为一系列位的过程，以便它可以存储在文件或内存缓冲区中，或通过网络连接链路传输，以便稍后在同一个或另一个计算机环境中重建。

设计一个算法来序列化和反序列化二叉搜索树。 确保二叉搜索树可以序列化为字符串，并且可以将该字符串反序列化为最初的二叉搜索树。

首先，定义二叉树：

from collections import deque


class TreeNode(object):
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

方法一：先序遍历+BFS

def serialize(root):
    """Encodes a tree to a single string.
    :type root: TreeNode
    :rtype: str
    """
    res = []
    queue = deque()
    if root:
        queue.append(root)
    while queue:
        cur = queue.popleft()
        if cur:
            res.append(str(cur.val))
            queue.append(cur.left)
            queue.append(cur.right)
        else:
            res.append("#")
    return ",".join(res)


def deserialize(data):
    """Decodes your encoded data to tree.
    :type data: str
    :rtype: TreeNode
    """
    if not data:
        return
    data = data.split(",")[::-1]
    root = TreeNode(int(data.pop()))
    queue = deque([root])
    while queue:
        cur = queue.popleft()
        left_val = data.pop()
        if left_val != "#":
            cur.left = TreeNode(int(left_val))
            queue.append(cur.left)
        right_val = data.pop()
        if right_val != "#":
            cur.right = TreeNode(int(right_val))
            queue.append(cur.right)
    return root

方法二：后序遍历+DFS

def serialize(root):
    """Encodes a tree to a single string.
        :type root: TreeNode
        :rtype: str
    """
    if not root:
        return "#"
    return ",".join([serialize(root.left), serialize(root.right), str(root.val)])


def deserialize(data):
    """Decodes your encoded data to tree.
    :type data: str
    :rtype: TreeNode
    """
    d = data.split(",")

    def dfs():
        val = d.pop()
        if val == "#":
            return
        node = TreeNode(int(val))
        node.right = dfs()
        node.left = dfs()
        return node

    return dfs()

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/serialize-and-deserialize-bst/