剑指offer--面试题62:序列化二叉树

题目描述

请实现两个函数,分别用来序列化和反序列化二叉树

python实现:

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
import json
class Solution:
    def Serialize1(self, root):
        # write code here
         
        def preOrder(root):
            if root:
                result.append(str(root.val))
                preOrder(root.left)
                preOrder(root.right)
            else:
                result.append("#")
        result = []
        preOrder(root)
        return ",".join(result)
         
             
         
         
    def Deserialize1(self, s):
        # write code here
        slist = s.split(",")     
        idx = [-1]
        def do(idx):
            idx[0] += 1
             
            if idx[0]<len(slist):
                #print "idx:", idx[0], "val:", slist[idx[0]]
                if slist[idx[0]]=="#":
                    return None
                root = TreeNode(int(slist[idx[0]]))
                root.left = do(idx)
                root.right = do(idx)
                return root
            else:
                return None
        return do(idx)
     
    #法2:使用迭代器
    def Deserialize2(self, s):    
        def do():
            try:
                val = next(it)
                if val=="#":
                    return None
                root = TreeNode(int(val))
                root.left = do()
                root.right = do()
                return root
            except StopIteration:
                pass
 
        it = iter(s.split(","))
        return do()
     
     
    #法3:
    def Serialize(self, root):
        def tuplify(root):
            return root and (root.val, tuplify(root.left), tuplify(root.right))#######root.val
        return json.dumps(tuplify(root))
     
    def Deserialize(self, s):
        def detuplify(t):
            if t:
                root = TreeNode(int(t[0]))
                root.left = detuplify(t[1])
                root.right = detuplify(t[2])
                return root#############3
        return detuplify(json.loads(s))


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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值