1110. Complete Binary Tree

1110. Complete Binary Tree (25)

時間限制

400 ms

內存限制

65536 kB

代碼長度限制

16000 B

判題程序

Standard

作者

CHEN, Yue

Given a tree, you are supposed to tell if it is a complete binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (<=20) which is the total number of nodes in the tree -- and hence the nodes are numbered from 0 to N-1. Then N lines follow, each corresponds to a node, and gives the indices of the left and right children of the node. If the child does not exist, a "-" will be put at the position. Any pair of children are separated by a space.

Output Specification:

For each case, print in one line "YES" and the index of the last node if the tree is a complete binary tree, or "NO" and the index of the root if not. There must be exactly one space separating the word and the number.

Sample Input 1:

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

Sample Output 1:

YES 8

Sample Input 2:

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

Sample Output 2:

NO 1

---

提交代碼

這個題真是犯了一個低級的錯誤，我開始用字符變量來輸入，然而一個字符變量只能賦一個數字，所以如果數的數據有二位數，那麼字符變量只能錄入十位數字，或者就出錯，出現段錯誤，真的要把字符串這一塊好好練練，很簡單一個題，結果廢了很長時間。