题解 | #二叉树遍历#
二叉树遍历
http://www.nowcoder.com/practice/6e732a9632bc4d12b442469aed7fe9ce
#include using namespace std;
void buildtree(string preo, string ino){ if(preo.size() == 0) return; int pos = ino.find(preo[0]); buildtree(preo.substr(1, pos), ino.substr(0, pos)); buildtree(preo.substr(1 + pos), ino.substr(1 + pos)); cout << preo[0]; }
int main(){ string preo, ino, posto; getline(cin, preo); getline(cin, ino); buildtree(preo, ino); return 0; }
