hihoCoder#1049 后序遍历

原题地址

基本二叉树操作

代码：

#include <iostream>
#include <cstring>

using namespace std;

void restore(char *pre, char *in, int len) {
  if (len == 0)
    return;

  int left = 0;
  while (in[left] != pre[0])
    left++;
  restore(pre + 1, in, left);
  restore(pre + 1 + left, in + 1 + left, len - left - 1);
  cout << pre[0];
}

int main() {
  char pre[32] = {0};
  char in[32] = {0};
  int len = 0;

  cin >> pre;
  cin >> in;
  len = strlen(pre);

  restore(pre, in, len);
  cout << endl;

  return 0;
}