[HDOJ3791]二叉搜索树

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3791

给一个序列，让你判断接下来输入的n个序列是否可以生成同一个二叉树。

BFS一遍就可以了。

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>

using namespace std;

typedef struct Node {
    Node* left;
    Node* right;
    int data;
    Node() { left = NULL; right = NULL; }
}Node;

queue<Node*> q;

Node* insert(Node* cur, int data) {
    if(cur == NULL) {
        cur = new Node();
        cur->data = data;
        return cur;
    }
    if(data > cur->data) {
        cur->right = insert(cur->right, data);
    }
    else {
        cur->left = insert(cur->left, data);
    }
    return cur;
}

const int maxn = 11;
int n;
char tmp[maxn];
char a[maxn], b[maxn];

void bfs(char* x) {
    Node* root = NULL;
    scanf("%s", tmp);
    int len = strlen(tmp);
    for(int i = 0; i < len; i++) {
        root = insert(root, tmp[i]-'0');
    }
    int cnt = 0;
      while(!q.empty()) q.pop();
      q.push(root);
    while(!q.empty()) {
        Node* tmp = q.front();
        x[cnt++] = q.front()->data + '0';
        if(tmp->left) q.push(tmp->left);
        if(tmp->right) q.push(tmp->right);
        q.pop();
    }
}


int main() {
    // freopen("in", "r", stdin);
    while(~scanf("%d", &n) && n) {
        memset(a, 0 , sizeof(a));
        memset(b, 0 , sizeof(b));
        bfs(a);
        for(int i = 0; i < n; i++) {
            bfs(b);
            if(strcmp(a, b) == 0) {
                printf("YES
");
            }
            else {
                printf("NO
");
            }
        }
    }
    return 0;
}