UVA 122 Trees on the level 二叉树层次遍历 数组&指针

Trees on the level

Trees are fundamental in many branches of computer science (Pun definitely intended). Current stateof-the
art parallel computers such as Thinking Machines’ CM-5 are based on fat trees. Quad- and
octal-trees are fundamental to many algorithms in computer graphics.
This problem involves building and traversing binary trees.
Given a sequence of binary trees, you are to write a program
that prints a level-order traversal of each tree. In this
problem each node of a binary tree contains a positive integer
and all binary trees have have fewer than 256 nodes.
In a level-order traversal of a tree, the data in all nodes at
a given level are printed in left-to-right order and all nodes at
level k are printed before all nodes at level k + 1.
For example, a level order traversal of the tree on the right
is: 5, 4, 8, 11, 13, 4, 7, 2, 1.
In this problem a binary tree is specified by a sequence
of pairs ‘(n,s)’ where n is the value at the node whose path
from the root is given by the string s. A path is given be
a sequence of ‘L’s and ‘R’s where ‘L’ indicates a left branch and ‘R’ indicates a right branch. In the
tree diagrammed above, the node containing 13 is specified by (13,RL), and the node containing 2 is
specified by (2,LLR). The root node is specified by (5,) where the empty string indicates the path from
the root to itself. A binary tree is considered to be completely specified if every node on all root-to-node
paths in the tree is given a value exactly once.
Input
The input is a sequence of binary trees specified as described above. Each tree in a sequence consists
of several pairs ‘(n,s)’ as described above separated by whitespace. The last entry in each tree is ‘()’.
No whitespace appears between left and right parentheses.
All nodes contain a positive integer. Every tree in the input will consist of at least one node and
no more than 256 nodes. Input is terminated by end-of-file.
Output
For each completely specified binary tree in the input file, the level order traversal of that tree should
be printed. If a tree is not completely specified, i.e., some node in the tree is NOT given a value or a
node is given a value more than once, then the string ‘not complete’ should be printed.
Sample Input
(11,LL) (7,LLL) (8,R)
(5,) (4,L) (13,RL) (2,LLR) (1,RRR) (4,RR) ()
(3,L) (4,R) ()
Sample Output
5 4 8 11 13 4 7 2 1
not complete

题目链接：https://vjudge.net/problem/UVA-122

题意：

(11,LL)表示节点值为11，在第二层的左，第三层的左；
(5,)表示根节点;
总之，每一个L或者R代表从root到达该节点在每一层的转向,问，给一串这样的字符串，输出二叉树层序遍历的结果，
如果输入重复或者节点的val为0则表示输出错误“not complete”.

题解：

根据输入构造二叉树，然后用queue层序遍历输出即可。
（1）根据输入创建二叉树，技巧：sscanf(&s[1], "%d", &v),从数组中读取数字，strchr(s, ',')+1获取数字后的字符串最后一个')'在处理时忽略;
（2）指针实现时，记得deletenode,root要先newnode;
（3）数组实现时，各节点按顺序存放，通过lf[maxn]和rt[maxn]数组确定左右节点；
（4）注意，已经有值的节点重复赋值要另flag = false,以及层序遍历时出现未赋值节点也要flag = false.

---

指针实现代码：

//#include <bits/stdc++.h>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<stack>
#include<queue>
#include<iostream>
#define INF 0xffffffff
using namespace std;
typedef long long ll;

const int maxn = 300;

char s[maxn];
bool failed;
vector<int> a; 

struct Node{
    bool have_value;
    int v;
    Node *left, *right;
    Node():have_value(false), left(NULL), right(NULL){}
};
Node* root;

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

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;
}

bool read_input(){
    failed = false;
    remove_tree(root);
    root = newnode();
    for(;;){
        if(scanf("%s", s) != 1) return false;
        if(!strcmp(s, "()")) break;
        int v;
        sscanf(&s[1], "%d", &v);
        addnode(v, strchr(s, ',')+1);
    }
    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(){
    while(read_input()){
        if(bfs(a) && !failed){
            for(int i=0; i<a.size(); i++){
                if(i >0) printf(" ");
                printf("%d", a[i]);
            }
            printf("\n");
        }
        else{
            printf("not complete\n");
        }
    }
    return 0;
}

---

数组实现代码：

//#include <bits/stdc++.h>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<stack>
#include<queue>
#include<iostream>
#define INF 0xffffffff
using namespace std;
typedef long long ll;

const int maxn = 300;
const int root = 1;

int lf[maxn];
int rt[maxn];
bool hv[maxn];
int val[maxn];
vector<int> ans;
bool flag;
int cnt;

void newtree(){
    cnt = root;
    lf[root] = rt[root] = 0;
    hv[root] = false;
}

int newnode(){
    int u = ++cnt;
    lf[u] = rt[u] = 0;
    hv[u] = false;
    return u;
} 

void addnode(int v, char *s){
    int n = strlen(s);
    int u = root;
    for(int i=0; i<n; i++){
        if(s[i] == 'L'){
            if(lf[u] == 0) lf[u] = newnode();
            u = lf[u];
        }
        else if(s[i] == 'R'){
            if(rt[u] == 0) rt[u] = newnode();
            u = rt[u];
        }
    }
    if(hv[u]) flag = false;
    val[u] = v;
    hv[u] = true;
}

bool input(){
    newtree();
    flag = true;
    char s[30];
    for(;;){
        if(scanf("%s", s)!=1) return false;
        if(!strcmp(s, "()")) break;
        int v;
        sscanf(&s[1], "%d", &v);
        addnode(v, strchr(s, ',')+1);
    }
    return true;
}

bool bfs(){
    ans.clear();
    queue<int> q;
    q.push(root);
    while(!q.empty()){
        int u = q.front();
        q.pop();
        if(hv[u] == false) return false;
        ans.push_back(val[u]);
        if(lf[u] != 0) q.push(lf[u]);
        if(rt[u] != 0) q.push(rt[u]);
    }
    return true;
}

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