代码面试集锦 2 - Google

标签：ack   str   int   roo   pass   amp   sel   binary   one   

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 Node class

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'

代码面试集锦 2 - Google

标签：ack   str   int   roo   pass   amp   sel   binary   one   

原文地址：https://www.cnblogs.com/Wonner/p/10360788.html