请实现两个函数,分别用来序列化和反序列化二叉树。
示例:
你可以将以下二叉树:
序列化为 “[1,2,3,null,null,4,5]”
注意:本题与主站 297 题相同:https://leetcode-cn.c
om/problems/serialize-and-deserialize-binary-tree/
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/xu-lie-hua-er-cha-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题目说的说的并不清楚到底要干嘛,简单说下,题意就是:给以你一棵二叉树,然后需要你给出它序列化后的值(即一个list),最后还需要你根据你序列化后的值重新构造一棵二叉树。
思路1:
**序列化:**其实就是二叉树的层次遍历,直接利用colletions的双端队列,利用队列即可实现。如下图所示,需要注意的是,我们可以将叶子节点的左右节点的Null打印出来,因为并不影响最终反序列化的结果。如果不希望多打印出null,则需要记录层数,然后对于对底层叶子节点的null不输出。
反序列化:其实就是根据二叉的层次遍历构建二叉树的工作。
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
from collections import deque
class Codec:
def serialize(self, root):
"""Encodes a tree to a single string.
:type root: TreeNode
:rtype: str
"""
if not root:
return []
queue = deque()
queue.append(root)
ans = []
count = 0
lay = 1
# 层序遍历
while queue:
node = queue.popleft()
ans.append(node.val if node else None)
if node == None:
continue
queue.append(node.left)
queue.append(node.right)
# print(ans)
return ans
def deserialize(self, data):
"""Decodes your encoded data to tree.
:type data: str
:rtype: TreeNode
"""
if data == [] or not data:
return None
queue = deque()
root = TreeNode(data[0])
queue.append(root)
t = 1
# 层序遍历,构建二叉树
while queue and t < len(data):
top = queue.popleft()
if data[t] != None:
top.left = TreeNode(data[t])
queue.append(top.left)
t += 1
if data[t] != None:
top.right = TreeNode(data[t])
queue.append(top.right)
t += 1
return root
# Your Codec object will be instantiated and called as such:
# codec = Codec()
# codec.deserialize(codec.serialize(root))