[LeetCode 297. Serialize and Deserialize Binary Tree] Tree를 문자열로 만들고 문자열을 다시 Tree로 만들기
Algorithm/LeetCode 문제 풀이 2019. 5. 3. 18:26Tree를 문자열로 만들고 문자열을 다시 Tree로 만들기
# 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.traversal = []
def serialize(self, root):
"""Encodes a tree to a single string.
:type root: TreeNode
:rtype: str
"""
if root is None:
self.traversal.append('#')
return ' '.join(self.traversal)
self.traversal.append(str(root.val))
self.serialize(root.left)
self.serialize(root.right)
return ' '.join(self.traversal)
def deserialize(self, data):
"""Decodes your encoded data to tree.
:type data: str
:rtype: TreeNode
"""
#print(data)
def makeTree():
val = next(vals)
if val == '#':
return
root = TreeNode(int(val))
root.left = makeTree()
root.right = makeTree()
return root
vals = iter(data.split())
return makeTree()
# Your Codec object will be instantiated and called as such:
# codec = Codec()
# codec.deserialize(codec.serialize(root))
'Algorithm > LeetCode 문제 풀이' 카테고리의 다른 글
[LeetCode 344. Reverse String Easy] Python 자신감 뿜뿜 (0) | 2019.05.11 |
---|---|
[LeetCode 541. Reverse String II] python 오랜만에 LeetCode를 풀었다. (0) | 2019.05.11 |
[LeetCode 144. Binary Tree Preorder Traversal] Python 트리 기초 preorder (0) | 2019.05.03 |
[LeetCode 94. Binary Tree Inorder Traversal] Inorder Tree 구조 (0) | 2019.05.01 |
[LeetCode 589. N-ary Tree Preorder Traversal ] Python 트리 구조 기초 (0) | 2019.05.01 |