Problem 2672 --Tree - Binary Trees

2672: Tree - Binary Trees

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $2$ 正确数量 $1$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

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.

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.

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.

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
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
1 ≤ n ≤ 25

推荐代码 查看2672 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$82 $ms] 忆一九 808195 2022-01-31 13:51:51
内存最少[$197396 $KB] 忆一九 808195 2022-01-31 13:51:51
第一AC 忆一九 808195 2022-01-31 13:51:51
第一挑战 囧囧JOJO 756674 2021-06-13 23:27:59

赛题来源/所属竞赛 会津大学《挑战数据结构与算法》 挑战数据结构与算法

竞赛编号 竞赛名称 竞赛时间 访问比赛