重构二叉树,已知前序和中序,输出后序。
#include <iostream>#include <cstring>using namespace std;
struct treeNode{ treeNode(); char letter; treeNode* left; treeNode* right;};treeNode::treeNode(){ left=NULL; right=NULL;}void AddNode(treeNode* node,bool left,bool right,char ch){ treeNode* tmpNode=new treeNode; tmpNode->letter=ch;
if(true==left) { node->left=tmpNode; } else { node->right=tmpNode; }}int findSameLetter(char letter,char str[],int startPoint){ int len=0; f......
阅读全文