剑指offer62题序列化二叉树

来源：互联网发布：程序员必读书单颈椎病编辑：程序博客网时间：2024/04/28 17:48

void Serialize(BinaryTreeNode* pRoot, ostream& stream)
{
if(pRoot == NULL)
{
stream << “$,”;
return;
}

stream << pRoot->m_nValue << ',';Serialize(pRoot->m_pLeft, stream);Serialize(pRoot->m_pRight, stream);

}

bool ReadStream(istream& stream, int* number)
{
if(stream.eof())
return false;

char buffer[32];buffer[0] = '\0';char ch;stream >> ch;int i = 0;while(!stream.eof() && ch != ','){    buffer[i++] = ch;    stream >> ch;}bool isNumeric = false;if(i > 0 && buffer[0] != '$'){    *number = atoi(buffer);    isNumeric = true;}return isNumeric;

}

void Deserialize(BinaryTreeNode** pRoot, istream& stream)
{
int number;
` if(ReadStream(stream, &number))
{
*pRoot = new BinaryTreeNode();
(*pRoot)->m_nValue = number;
(*pRoot)->m_pLeft = NULL;
(*pRoot)->m_pRight = NULL;

    Deserialize(&((*pRoot)->m_pLeft), stream);    Deserialize(&((*pRoot)->m_pRight), stream);}

}

0 0