LintCode-527: Trie Serialization (System Design重要题！)

serialize() 用DFS深搜。
deserialize() 有点像根据Trie树的前序遍历和><符号来重构Trie。

/**
 * Definition of TrieNode:
 * class TrieNode {
 * public:
 *     TrieNode() {}
 *     map<char, TrieNode*> children;
 * };
 */
class Solution {
public:
    /**
     * This method will be invoked first, you should design your own algorithm 
     * to serialize a trie which denote by a root node to a string which
     * can be easily deserialized by your own "deserialize" method later.
     */
    string serialize(TrieNode* root) {

        if (!root) return "";

        string result;

        for (auto c : root->children) {
            result = result + c.first + serialize(c.second);
        }

        return "<" + result + ">";
    }

    /**
     * This method will be invoked second, the argument data is what exactly
     * you serialized at method "serialize", that means the data is not given by
     * system, it's given by your own serialize method. So the format of data is
     * designed by yourself, and deserialize it here as you serialize it in 
     * "serialize" method.
     */
    TrieNode* deserialize(string data) {
        if (data.size() == 0)
            return nullptr;

        TrieNode *root = new TrieNode();
        TrieNode *p = root;
        stack<TrieNode *> st;
        size_t dataSize = data.size();

        for (int i = 0; i < dataSize; ++i) {
            switch (data[i]) {
                case '<':
                    st.push(p);
                    break;
                case '>':
                    st.pop();
                    break;
                default:
                    p = new TrieNode();
                    st.top()->children[data[i]] = p;
            }
        }

        return root;
    }
};