Problem 1 Please write a Python program which serializes a binary tree (each node contains a character) and deserializes back to the original binary tree with O(n) complexity, where n is the number of...

please see instructions in the word doc


Problem 1 Please write a Python program which serializes a binary tree (each node contains a character) and deserializes back to the original binary tree with O(n) complexity, where n is the number of nodes in the binary tree. This is useful in transmit data from one site to another using communication network by serializing the data from source site, transmit the serialized data via the network, and then deserializes the data back to the original form. To make your job easier, you can serialize binary tree by generating preorder traversal sequence from the binary tree and then concatenating the in-order traversal sequence. Then do deserialization on the other site by reconstruct the binary tree accordingly, and print the postorder traversal sequence to verify your code is correct. In theory, you can use either preorder with in-order or use post-order with in-order, but the former one is easier than the latter because the first node in the preorder traversal is the root of the binary tree. Please name this program either p10.py or p10.ipynb. Your program should read all ta*.dat in the same directory as your p10.py or p10.ipynb, and generate output for each ta*.dat as the example below.   Example Input: abcdefg # preorder cbaedfg # inorder   Example Postorder Output: cbegfda