offer_37

//面试题37：序列化二叉树(序列化和反序列化)

//序列化
void Serialize(BinaryTreeNode* pRoot,ostream& stream)
{
  if(pRoot==nullptr)
  {
    stream<<"$,";
    return;
  }
  stream<<pRoot->m_mValue<<',';
 Serialize(pRoot->m_pLeft,stream);
 Serialize(pRoot->m_pRight,stream);
}

//反序列化
void Descrialize(BinaryTreeNode** pRoot,istream& stream)
{
  int number;
  if(ReadStream(stream,&number)){
    *pRoot=new BinaryTreeNode();
    (*pRoot)->m_nValue=number;
    (*pRoot)->m_pLeft=nullptr;
    (*pRoot)->m_pRight=nullptr;
    Descrialize(&((*pRoot)->m_pLeft),stream);
    Descrialize(&((*pRoot)->m_pRight),stream);
  }
}
//ReadStream每次从流中读出一个数字或者一个字符‘$’，当从流中读出的是一个数字时，函数返回true，否则返回false；