《剑指Offer》刷题笔记——面试题37. 序列化二叉树

难度:困难 一、题目描述: 二、解题分析: # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Codec: def __init__(self): self.strTree = [] def serialize(self, root): """En