LeetCode297. Serialize and Deserialize Binary Tree

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.

Example: 

You may serialize the following tree:

    1
   / \
  2   3
     / \
    4   5

as "[1,2,3,null,null,4,5]"

Clarification: The above format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.

Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

思路：

这道题是让我们尝试写出二叉树到字符串的转换和复原，我们参考了LeetCode的数据传输格式；注意在复原的时候，我们需要考虑一个节点的左右两个子节点，代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Codec {
public:
	// Encodes a tree to a single string.
	string serialize(TreeNode* root) {
		list<TreeNode*> l;
		l.push_back(root);
		string res;
		while (l.size() > 0) {
			root = l.front();
			l.pop_front();
			if (root == NULL) {
				res += " *";
				continue;
			}
			else {
				res += " " + to_string(root->val);
			}
			l.push_back(root->left);
			l.push_back(root->right);

		}
		return res.substr(1);
	}

	// Decodes your encoded data to tree.
	TreeNode* deserialize(string data) {
		list<TreeNode*> l;
		int num = 0;
		bool flag = true;
		TreeNode* res = NULL;
		bool isNum = true;
		int signal = 1;
		for (int i = 0; i < data.size(); i++) {
			TreeNode* child = NULL;
			if (data[i] == '*') isNum = false;
			else if (isdigit(data[i])) {
				isNum = true;
				num = num * 10 + data[i] - '0';
				continue;
			}
			else if (data[i] == '-') signal = -1;
			else {
				if(isNum) child = new TreeNode(signal*num);
                signal = 1;
				num = 0;
				if (l.size() == 0) {
					l.push_back(child);
					if(res == NULL)res = child;
				}
				else {
					TreeNode* root = l.front();
					if (!flag) l.pop_front();
					if (child != NULL) l.push_back(child);
					if (flag) root->left = child;
					else root->right = child;
					flag = !flag;
				}
			}
		}
		return res;
	}
};

// Your Codec object will be instantiated and called as such:
// Codec codec;
// codec.deserialize(codec.serialize(root));