Python序列化/反序列化二叉树

import pickle

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

def serialize(root):
    if not root:
        return None
    serialized = []
    queue = [root]
    while queue:
        node = queue.pop(0)
        if node:
            serialized.append(node.val)
            queue.append(node.left)
            queue.append(node.right)
        else:
            serialized.append(None)
    return serialized

def deserialize(serialized):
    if not serialized:
        return None
    root = TreeNode(serialized[0])
    queue = [root]
    i = 1
    while queue:
        node = queue.pop(0)
        if serialized[i] is not None:
            node.left = TreeNode(serialized[i])
            queue.append(node.left)
        i += 1
        if serialized[i] is not None:
            node.right = TreeNode(serialized[i])
            queue.append(node.right)
        i += 1
    return root

# 示例二叉树
root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.right.left = TreeNode(4)
root.right.right = TreeNode(5)

# 序列化二叉树
serialized_tree = serialize(root)
print("Serialized Tree:", serialized_tree)

# 反序列化二叉树
deserialized_tree = deserialize(serialized_tree)
print("Deserialized Tree:", deserialized_tree)