python 之树序列化和反序列化

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


class Solution(object):
    def creatTree(self):
        t = TreeNode(1)
        t.left = TreeNode(2)
        t.right = TreeNode(3)
        t.left.left = TreeNode(4)
        t.right.left = TreeNode(5)
        t.right.right = TreeNode(6)
        return t
        
    def serialize(self, root):
        res = []
        def pre(root):
            if root:
                res.append(root.val)
                pre(root.left)
                pre(root.right)
            else:
                res.append("#")
        pre(root)
        return str(res)

    def deserialized(self, data):
        import json
        data = json.loads(data)
        def build():
            if data:
                val = data.pop(0)
                if val == "#":
                    return None
                root = TreeNode(val)
                root.left = build()
                root.right = build()
                return root

        return build()
    def chengci(self, root):
        res = []
        stack = [root]
        while stack:
            r = stack.pop(0)
            if r:
                res.append(r.val)
                stack.append(r.left)
                stack.append(r.right)
            else:
                res.append("#")
        return res
    def dechengci(self, data):
        import json
        rstack = []
        data = json.loads(data)
        if data:
            new = TreeNode(data.pop(0))
            res = new
            rstack.append(res)
        while data:
            r = rstack.pop(0)
            if data:
                d = data.pop(0)
                if d:
                    r.left = TreeNode(d)
                    rstack.append(r.left)
            if data:
                d = data.pop(0)
                if d:
                    r.right = TreeNode(d)
                    rstack.append(r.right)
        return res
                
    
s = Solution()
data = '[1,2,4,"#","#","#",3,5,"#","#",6,"#","#"]'
tree = s.deserialized(data)
string = s.serialize(tree)
print(string)
string = s.chengci(tree)
print(string)
print("----------------------------------------------------")
tree = s.creatTree()
string = s.serialize(tree)
print(string)

 

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值