Welcome to another coding interview sample question blog!
In today’s episode, we are gonna test your skills at binary tree serialization. This sample question is of medium difficulty. Can you solve it?
Given the root to a binary tree, implement
serialize(root), which serializes the tree into a string, and
deserialize(s), which deserializes the string back into the tree.
For example, given the following
class Node: def __init__(self, val, left=None, right=None): self.val = val self.left = left self.right = right
The following test should pass:
node = Node('root', Node('left', Node('left.left')), Node('right')) assert deserialize(serialize(node)).
left.left.val == 'left.left'