Serialize and DeSerialize
2017-03-15 22:20
239 查看
class Solution { private: void serializehelper(TreeNode *root,vector<int> &v) { if(root==NULL) { v.push_back(0x23333333); return; } v.push_back(root->val); serializehelper(root->left,v); serializehelper(root->right,v); } TreeNode* deserializehelper(int *&p) { if(*p==0x23333333) { p++; return NULL; } TreeNode *ret=new TreeNode(*p); p++; ret->left=deserializehelper(p); ret->right=deserializehelper(p); return ret; } public: char* Serialize(TreeNode *root) { vector<int>v; serializehelper(root,v); int *numbers=new int[v.size()]; for(int i=0;i<v.size();i++) { numbers[i]=v[i]; } return (char*)numbers; } TreeNode* Deserialize(char *str) { int *p=(int *)str; return deserializehelper(p); } };
相关文章推荐
- Serialize and Deserialize Binary Tree_Week9
- Serialize and Deserialize BST
- 297. Serialize and Deserialize Binary Tree
- 297. Serialize and Deserialize Binary Tree
- 297. Serialize and Deserialize Binary Tree
- [LeetCode 297] Serialize and Deserialize Binary Tree
- Serialize and Deserialize
- Leetcode: Serialize and Deserialize BST
- Serialize and Deserialize Binary Tree
- Leetcode 297 Serialize and Deserialize Binary Tree(序列化与反序列化二叉树)
- 297. Serialize and Deserialize Binary Tree
- 297. Serialize and Deserialize Binary Tree
- Serialize and Deserialize Binary Tree
- Serialize and Deserialize
- Serialize and Deserialize Binary Tree
- Leetcode 297. Serialize and Deserialize Binary Tree
- 139.Serialize and Deserialize Binary Tree
- 297. Serialize and Deserialize Binary Tree 二叉树的序列化和去序列化
- LeetCode Serialize and Deserialize Binary Tree
- 297. Serialize and Deserialize Binary Tree