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.
For example, you may serialize the following tree
1 / 2 3 / 4 5
as "[1,2,3,null,null,4,5]"
, just the same as how LeetCode OJ 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.
#include <iostream> #include <string> #include <stack> #include <vector> #include <queue> #include <stdio.h> #include <cstdlib> using namespace std; struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {} }; /* * 自定义的字符串格式为123#345# * 通过#来分割 * */ class MyString { private: const string delimiter = "#"; string words; int index; public: MyString():words(""),index(0) {} string _covert_to_string(int i) { char c[8]; snprintf(c,7, "%d", i); return static_cast<string>(c); } void add_word(int word) { if (word != INT_MAX) { string s_word = _covert_to_string(word); words.append(s_word); } else { words.append("NULL"); } words.append(delimiter); } string get_string() { return words; } void set_string(string s) { words = s; } int get_next_word() { string res = ""; if (words[index]== '