Serialización:Input1:      1    / \   3   4  / \   \ 2   5   7Output1: 1 3 2 # # 5 # # 4 # 7 # #Antisecu serializaciónInput2: 1 3 2 # # 5 # # 4 # 7 # #Output2: 132547El orden frontal atraviesa el árbol de salida//      1//     / \//    3   4//   / \   \//  2   5   7

#!/usr/bin/env python3# -*- coding: utf-8 -*-# Node classclass Node:    def __init__(self, value):        self.value = value        self.left = None        self.right = None            Define la forma en que se genera el árbol a medida que se atraviesa en el orden de reserva del árbol.    def __str__(self):        preOrder = ''        preOrder += str(self.value)        if self.left:            preOrder += str(self.left)        if self.right:            preOrder += str(self.right)        return preOrder        #前序遍历输出树的结点, #表示该结点为空.def serialize(tree):    if tree is None:        return '#'    return '{} {} {}'.format(tree.value, serialize(tree.left), serialize(tree.right))
def deserialize(string):    def helper():        value = next(values)        if value == '#':            return None        node = Node(int(value))        node.left = helper()        node.right = helper()        return node    values = iter(string.split())    return helper()
# Test Program#     1#     / \#   3   4#   / \   \# 2   5   7tree = Node(1)tree.left = Node(3)tree.left.left = Node(2)tree.left.right = Node(5)tree.right = Node(4)tree.right.right = Node(7)
print(serialize(tree))# 1 3 2 # # 5 # # 4 # 7 # #print(deserialize('1 3 2 # # 5 # # 4 # 7 # #'))# 132547