lc 297. Serialize and Deserialize Binary Tree

使用任意方法序列化一个二叉树。

https://leetcode.com/problems/serialize-and-deserialize-binary-tree/

原来带有None作为结束标志的x序遍历的结果是可以唯一的恢复一颗二叉树的！！！

如果没有None结束标记，是无法做到的！

代码没法子讲，自己看吧。

如何快速打印？先print(serialize)，再print(serialize(deserialize(serialize(root))))

 1 class Codec:
 2
 3     def serialize(self, root):
 4         """Encodes a tree to a single string.
 5
 6         :type root: TreeNode
 7         :rtype: str
 8         """
 9         def rec(root):
10             if root==None:
11                 return 'None,'
12             return str(root.val)+','+rec(root.left)+rec(root.right)
13         return rec(root)
14
15     def deserialize(self, data):
16         """Decodes your encoded data to tree.
17
18         :type data: str
19         :rtype: TreeNode
20         """
21         def rec(start):
22             i=start
23             while data[i]!=',':
24                 i+=1
25             if i-start==4 and data[start:i]=='None':
26                 return None,start+5
27             # print(data[start:i],'to trans')
28             node=TreeNode(int(data[start:i]))
29             l,ls=rec(i+1)
30             r,rs=rec(ls)
31             node.left=l
32             node.right=r
33             return node,rs
34         return rec(0)[0]

转载于:https://www.cnblogs.com/waldenlake/p/10650710.html

lc 297. Serialize and Deserialize Binary Tree相关推荐

297. Serialize and Deserialize Binary Tree
Title 序列化是将一个数据结构或者对象转换为连续的比特位的操作,进而可以将转换后的数据存储在一个文件或者内存中,同时也可以通过网络传输到另一个计算机环境,采取相反方式重构得到原数据. 请设计一个算 ...
LeetCode 297 Serialize and Deserialize Binary Tree
题目描述 Serialization is the process of converting a data structure or object into a sequence of bits s ...
[Java]LeetCode297. 二叉树的序列化与反序列化 | Serialize and Deserialize Binary Tree
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
LC 104. Maximum Depth of Binary Tree
1.题意 104. Maximum Depth of Binary Tree Easy 98540 Given a binary tree, find its maximum depth. The m ...
leetcode 449. Serialize and Deserialize BST | 449. 序列化和反序列化二叉搜索树（BST后序遍历性质）
题目 https://leetcode.com/problems/serialize-and-deserialize-bst/ 题解本题的难点在于利用 BST 的性质. 几个提示根据后序遍历BS ...
由任意二叉树的前序遍历序列和中序遍历序列求二叉树的思想方法_算法与数据结构基础 - 二叉树(Binary Tree)...
二叉树基础满足这样性质的树称为二叉树:空树或节点最多有两个子树,称为左子树.右子树, 左右子树节点同样最多有两个子树. 二叉树是递归定义的,因而常用递归/DFS的思想处理二叉树相关问题,例如Leet ...
序列化和反序列化二叉搜索树 Serialize and Deserialize BST
2019独角兽企业重金招聘Python工程师标准>>> 问题: Serialization is the process of converting a data structure ...
Construct Maximum Binary Tree
构建一颗「最大树」. 注意consruct的时候最后的return root; 我参考了serialize and deserialize binary tree的build tree 的过程. 这周 ...
Binary Tree Upside Down LC解题记录
题目内容 Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node ...

lc 297. Serialize and Deserialize Binary Tree

lc 297. Serialize and Deserialize Binary Tree相关推荐

最新文章

热门文章