【注意】
反序列化操作,只有先序序列化,从来没听说过中序序列化、后序序
列化。实际上有中序后序序列化反序列化
要求:将vector<string> str容器中的字符串生成二叉树
解答:
依次获取每一个字符串str[index],进行序列化操作:
先用str[index]生成根节点T
再递归生成左子树T->lchild
再递归生成右子树T->rchile
最后返回生成的整棵树的根节点T
#include <vector>
#include <string>
using namespace std;
typedef struct TreeNode
{
string data;
struct TreeNode* lchild;
struct TreeNode* rchild;
}TreeNode;
void pretravel(TreeNode* T)
{
if (T != NULL)
{
cout << T->data << " ";
pretravel(T->lchild);
pretravel(T->rchild);
}
}
int index = -1;
TreeNode* PreDeserialize(vector<string>& str)
{
index++;
if (index >= str.size() || str[index] == "#")
return NULL;
TreeNode* T = new TreeNode;
T->data = str[index];
T->lchild = PreDeserialize(str);
T->rchild = PreDeserialize(str);
return T;
}
int main()
{
vector<string> str = { "30", "10", "50", "#", "#", "#", "20", "45", "#", "#", "35", "#", "#" };
TreeNode* head = PreDeserialize(str);
pretravel(head);
return 0;
}