Is It A Tree?

FJNU.1687

Description
A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.
There is exactly one node, called the root, to which no directed edges point.
Every node except the root has exactly one edge pointing to it.
There is a unique sequence of directed edges from the root to each node.
For example, consider the illustrations below, in which nodes are represented by circles and edges are represented by lines with arrowheads. The first two of these are trees, but the last is not.

In this problem you will be given several descriptions of collections of nodes connected by directed edges. For each of these you are to determine if the collection satisfies the definition of a tree or not.

Input
The input will consist of a sequence of descriptions (test cases) followed by a pair of negative integers. Each test case will consist of a sequence of edge descriptions followed by a pair of zeroes Each edge description will consist of a pair of integers; the first integer identifies the node from which the edge begins, and the second integer identifies the node to which the edge is directed. Node numbers will always be greater than zero.

Output
For each test case display the line ``Case k is a tree." or the line ``Case k is not a tree.", where k corresponds to the test case number (they are sequentially numbered starting with 1).

Sample Input
6 8 5 3 5 2 6 4
5 6 0 0

8 1 7 3 6 2 8 9 7 5
7 4 7 8 7 6 0 0

3 8 6 8 6 4
5 3 5 6 5 2 0 0
-1 -1

Sample Output
Case 1 is a tree.
Case 2 is a tree.
Case 3 is not a tree.

Source
North Central North America 1997 

My Program

#include<iostream>
#define N 500
using namespace std;

typedef struct link
...{
    int data;
    struct link *parent;
    struct link *child;
    struct link *brother;
}node;
node *p,*q,*h;
node * iter[N];
bool flag;

bool IsTree()
...{
    int i,j;
    node *T=NULL;
    if(flag==false)
        return false;
    for(i=0,j=0;i<N;i++)
        if(iter[i]!=NULL)
            if(iter[i]->parent==NULL)
                if(T!=NULL) return false;
                else T=iter[i];
    if(T==NULL) return false;
    return true;
}

int main()
...{
    int a,b,k=0,n=0;flag=true;
    while(cin>>a>>b)
    ...{
        if(a==0&&b==0)
        ...{
            k++;
            cout<<"Case "<<k<<" is ";
            if(n!=0&&IsTree()==false) cout<<"not ";
            cout<<"a tree."<<endl;
            memset(iter,NULL,sizeof(iter));
            n=0;
            flag=true;
            continue;
        }
        if(a==-1&&b==-1)break;
        q=iter[b];
        if(q==NULL)
        ...{
            q=new node;
            q->parent=NULL;
            q->child=NULL;
            q->brother=NULL;
            q->data=b;
            iter[b]=q;
            n++;
        }
        p=iter[a];
        if(p==NULL)
        ...{
            p=new node;
            p->parent=NULL;
            p->child=q;
            p->brother=NULL;
            p->data=a;
            iter[a]=p;
            n++;
        }
        else
        ...{
            if(p->child==NULL)
                p->child=q;
            else
            ...{
                p=p->child;
                while(p->brother!=NULL) p=p->brother;
                p->brother=q;
            }
        }
        if(q->parent!=NULL)
            flag=false;
        else
            q->parent=iter[a];
    }
    return 0;
}

YOYO's Note:
┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄┄它是华丽的分隔线

【题意简述】

判断一些结点及其之间的连线构成的是否是一棵树（空树也是树）。
以下情况不是树：
当某个结点有一个以上双亲结点时，（根结点没有双亲）
当有一个以上根结点时，
当有重复边时，
当有回路时。


【粗略分析】

边输入边构造树，
边构造边可以判定子树是否已经有双亲结点、是则判定不是树。
构造完了检查，是否所有的顶点都有双亲结点，
是则一定有回路，即可判定其不是树，
否则判断是否只有一个点即根结点，超过也不是树。
就可以了，注意空树也是树。

【C++源代码】

#include<iostream>
#define N 500
using namespace std;

typedef struct link
...{
    int data;
    struct link *parent;
    struct link *child;
    struct link *brother;
}node;
node *p,*q,*h;
node * iter[N];
bool flag;

bool IsTree()
...{
    int i,j;
    node *T=NULL;
    if(flag==false)
        return false;
    for(i=0,j=0;i<N;i++)
        if(iter[i]!=NULL)
            if(iter[i]->parent==NULL)
                if(T!=NULL) return false;
                else T=iter[i];
    if(T==NULL) return false;
    return true;
}

int main()
...{
    int a,b,k=0,n=0;flag=true;
    while(cin>>a>>b)
    ...{
        if(a==0&&b==0)
        ...{
            k++;
            cout<<"Case "<<k<<" is ";
            if(n!=0&&IsTree()==false) cout<<"not ";
            cout<<"a tree."<<endl;
            memset(iter,NULL,sizeof(iter));
            n=0;
            flag=true;
            continue;
        }
        if(a==-1&&b==-1)break;
        q=iter[b];
        if(q==NULL)
        ...{
            q=new node;
            q->parent=NULL;
            q->child=NULL;
            q->brother=NULL;
            q->data=b;
            iter[b]=q;
            n++;
        }
        p=iter[a];
        if(p==NULL)
        ...{
            p=new node;
            p->parent=NULL;
            p->child=q;
            p->brother=NULL;
            p->data=a;
            iter[a]=p;
            n++;
        }
        else
        ...{
            if(p->child==NULL)
                p->child=q;
            else
            ...{
                p=p->child;
                while(p->brother!=NULL) p=p->brother;
                p->brother=q;
            }
        }
        if(q->parent!=NULL)
            flag=false;
        else
            q->parent=iter[a];
    }
    return 0;
}

【注意事项】

※ 空树也是树，即0 0 时它也是树
※ 有重复路径的就已经不是树了
※ 可能会有回路

【点评】

被0 0 害了好久WA……原因是我那里少了continue……