0
我想在二叉树的python中实现序列化/反序列化算法。Python序列化/反序列化的二叉树
这里是我的代码:
class Node:
count = 1
def __init__(self, value):
self.value = value
self.left = None
self.right = None
def insert(self, value):
if self.value > value:
if self.left is None:
self.left = Node(value)
Node.count += 1
else:
self.left.insert(value)
else:
if self.right is None:
self.right = Node(value)
Node.count += 1
else:
self.right.insert(value)
# Using preorder
def serialize(root, serial):
if root != None:
serial.append(root.value)
serialize(root.left, serial)
serialize(root.right, serial)
else:
serial.append('x')
def deserialize(newRoot, serial):
if serial[0] == 'x':
serial.pop(0)
else:
if len(serial) > 0:
newRoot = Node(serial.pop(0))
print(newRoot.value)
deserialize(newRoot.left, serial)
deserialize(newRoot.right, serial)
print("This program serializes a tree\n")
root = Node(3)
root.insert(1)
root.insert(2)
root.insert(4)
root.insert(5)
root.insert(0)
# Serialize
serial = []
serialize(root, serial)
print(serial)
# Deserialize
newRoot = Node(None)
deserialize(newRoot, serial)
print(newRoot.value)
的问题是,newRoot没有得到通过反序列化,因为蟒蛇按值传递更新。我如何解决这个问题,最好是以最优雅的方式?在C/C++中,我只是将一个指针传递给newRoot,它应该相应地更新。谢谢!
从函数返回新的根。而不是'def deserialize(newRoot,serial):'执行'def deserialize(serial):... return newRoot'。在调用者方面,收集返回的子树:'newRoot.left =反序列化(串行)'。 – DyZ