Aizu - ALDS1_7_B Binary Trees（二叉树的表达 不用指针建树来执行二叉树的条件）

Binary Tree

A rooted binary tree is a tree with a root node in which every node has at most two children.

Your task is to write a program which reads a rooted binary tree T and prints the following information for each node u of T:

• node ID of u
• parent of u
• sibling of u
• the number of children of u
• depth of u
• height of u
• node type (root, internal node or leaf)

If two nodes have the same parent, they are siblings. Here, if u and v have the same parent, we say u is a sibling of v(vice versa).

The height of a node in a tree is the number of edges on the longest simple downward path from the node to a leaf.

Here, the given binary tree consists of n nodes and evey node has a unique ID from 0 to n-1.

Input

The first line of the input includes an integer n, the number of nodes of the tree.

In the next n lines, the information of each node is given in the following format:

id left right

id is the node ID, left is ID of the left child and right is ID of the right child. If the node does not have the left (right) child, the left(right) is indicated by -1.

Output

Print the information of each node in the following format:

node id: parent = p , sibling = s , degree = deg, depth = dep, height = h, type

p is ID of its parent. If the node does not have a parent, print -1.

s is ID of its sibling. If the node does not have a sibling, print -1.

deg, dep and h are the number of children, depth and height of the node respectively.

type is a type of nodes represented by a string (root, internal node or leaf. If the root can be considered as a leaf or an internal node, print root.

Please follow the format presented in a sample output below.

Constraints

• 1 ≤ n ≤ 25

Sample Input 1

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

Sample Output 1

node 0: parent = -1, sibling = -1, degree = 2, depth = 0, height = 3, root
node 1: parent = 0, sibling = 4, degree = 2, depth = 1, height = 1, internal node
node 2: parent = 1, sibling = 3, degree = 0, depth = 2, height = 0, leaf
node 3: parent = 1, sibling = 2, degree = 0, depth = 2, height = 0, leaf
node 4: parent = 0, sibling = 1, degree = 2, depth = 1, height = 2, internal node
node 5: parent = 4, sibling = 8, degree = 2, depth = 2, height = 1, internal node
node 6: parent = 5, sibling = 7, degree = 0, depth = 3, height = 0, leaf
node 7: parent = 5, sibling = 6, degree = 0, depth = 3, height = 0, leaf
node 8: parent = 4, sibling = 5, degree = 0, depth = 2, height = 0, leaf

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

 

题意：建立一颗二叉树 题目要求依次输出：

节点编号 父节点  兄弟节点 （不存在都输出-1）子节点个数 深度 高

（结点x到叶结点的最大路径长度称为结点x的高）

 

#include<bits/stdc++.h>
using namespace std;
const int N=100;
const int NIL =-1;
struct node
{
	int p,r,l;
};
node T[N];
int leve[N];
int high[N];
void setDepth(int u,int d)//求结点的深度
{
    if(u==NIL)
        return ;
    leve[u]=d;
    setDepth(T[u].l,d+1);
    setDepth(T[u].r,d+1);
}
int setHeight(int u)//结点的高
{
    int h1=0,h2=0;
    if(T[u].l!=NIL)
        h1=setHeight(T[u].l)+1;
    if(T[u].r!=NIL)
        h2=setHeight(T[u].r)+1;
    return high[u]=h1>h2?h1:h2;
}
int getSibling(int u)//返回兄弟结点
{
    if(T[u].p==NIL)
        return NIL;
    if(T[T[u].p].l!=u&&T[T[u].p].l!=NIL)
        return T[T[u].p].l;
    if(T[T[u].p].r!=u&&T[T[u].p].r!=NIL)
        return T[T[u].p].r;
    return NIL;
}
void print(int u)
{
    cout<<"node "<<u<<": ";
    cout<<"parent = "<<T[u].p<<", ";
    cout<< "sibling = " <<getSibling(u)<<", ";
    int deg=0;
    if(T[u].l!=NIL)
        deg++;
    if(T[u].r!=NIL)
        deg++;
    cout<<"degree = "<<deg<<", ";
    cout<<"depth = "<<leve[u]<<", ";
    cout<<"height = "<<high[u]<<", ";
    if(T[u].p==NIL)
        cout<<"root"<<endl;
    else if(T[u].l==NIL&&T[u].r==NIL)
        cout<<"leaf"<<endl;
    else
        cout<<"internal node"<<endl;
}
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++) T[i].p=NIL;
	for(int i=0;i<n;i++){
		int v,l,r;
		cin>>v>>l>>r;
		T[v].l=l;
		T[v].r=r;
		if(l!=NIL) T[l].p=v;
		if(r!=NIL) T[r].p=v;
	}
	int id=0;
	for(int i=0;i<n;i++){
		if(T[i].p==NIL) id=i;
	}
	setDepth(id,0);
	setHeight(id);
	for(int i=0;i<n;i++) print(i);
	return 0;
}