序列化樹到使用python

Question

嵌套表我有一個二叉樹類是這樣的：

class BinaryTree: 
def __init__(self, data, left=None, right=None): 
    self.data = data 
    self.left = left 
    self.right = right 

現在我面臨的一個任務中嵌套列表序列化此結構。順便說一句，我心裏有一個左向右穿越功能：

def binary_tree(tree): 
    if tree: 
     for node_data in binary_tree(tree.left): 
      yield node_data 
     for node_data in binary_tree(tree.right): 
      yield node_data 

還是有它序列化到混合嵌套結構的一般方法是什麼？例如，{[]}或[{}]？

Answer 1

作爲BinaryTree的方法：

def to_dict(self): 
    data = self.data 
    left = self.left 
    if left is not None: 
     left = left.to_dict() 
    right = self.right 
    if right is not None: 
     right = right.to_dict() 
    return {'data':data, 'left':left, 'right':right} 

和作爲BinaryTree一個類的方法：

def from_dict(cls, D): 
    data = D['data'] 
    left = D['left'] 
    if left is not None: 
     left = cls.from_dict(left) 
    right = D['right'] 
    if right is not None: 
     right = cls.from_dict(right) 
    return cls(data, left, right)