Trees on the level

Trees on the level

寬度優(yōu)先遍歷bfs

/*
(11,LL) (7,LLL) (8,R) (5,) (4,L) (13,RL) (2,LLR) (1,RRR) (4,RR) ()
(3,L) (4,R) ()
*/
#include <cstdio>
#include  <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;

const int maxn = 256 + 10;

struct  Node
{
    bool have_value;  //是否被賦值過
    int v;
    Node *left, *right;
    Node() :have_value(false), left(NULL), right(NULL) {}; //構造函數(shù)
};

Node* root;
Node* newnode() { return new Node(); }

bool failed;

void addnode(int v, char* s) {
    int n = strlen(s);
    Node* u = root;
    for (int i = 0; i < n; i++)
        if (s[i] == 'L') {
            if (u->left == NULL) u->left = newnode();
            u = u->left;
        }
        else if (s[i] == 'R') {
            if (u->right == NULL) u->right = newnode();
            u = u->right;
        }
        if (u->have_value) failed = true;
        u->v = v;
        u->have_value = true;
}

void remove_tree(Node* u) {
    if (u == NULL) return;
    remove_tree(u->left);
    remove_tree(u->right);
    delete u;
}

char s[maxn];
bool read_input() {
    failed = false;
    remove_tree(root);//第二次循環(huán)（處理第二次輸入就清空樹）
    root = newnode(); //創(chuàng)建根節(jié)點
    for (;;) {
        if (scanf("%s", s) != 1) return false;//整個輸入結束
        if (!strcmp(s, "()")) break;//讀到結束標志（）猴伶，退出循環(huán)
        int v;
        sscanf(&s[1], "%d", &v);//讀入節(jié)點值
        addnode(v, strchr(s, ',') + 1);//查找逗號凤优，然后插入節(jié)點
    }
    return true;
}

bool bfs(vector<int>& ans) {
    queue<Node*> q;
    ans.clear();
    q.push(root);
    while (!q.empty()) {
        Node* u = q.front(); q.pop();
        if (!u->have_value) return false;
        ans.push_back(u->v);
        if (u->left != NULL) q.push(u->left);
        if (u->right != NULL) q.push(u->right);
    }
    return true;
}

int main() {
    vector<int> ans;
    while (read_input()) {
        if (!bfs(ans)) failed = 1;
        if (failed) printf("not complete\n");
        else {
            for (int i = 0; i < ans.size(); i++) {
                if (i != 0) printf(" ");
                printf("%d", ans[i]);
            }
            printf("\n");
        }
    }
    return 0;
}

運行結果：

運行結果