Description is given a binary tree structure to determine binary tree is not complete binary tree. You must use a binary tree class implementation. Input Format input file contains a total N+1 line. The first line contains a positive integer N, the total number of nodes in the tree representation. N+1 second line to the first line, each line contains two integers. Wherein the i-th row of two integers Pi, Qi, representative of the left child node i is Pi, the right child of Qi. If Pi = 0, it indicates that there is no left child node i. Similarly, if Qi = 0, it indicates that there is no right child node i. (Referring to the i-th row in the first line of this N i lines) Output Format If the tree is a complete binary tree is given, the output ' Y' , otherwise the output ' N' . (Exclude quotes)

1211\1211.cbp
....\1211.depend
....\1211.layout
....\123.cpp
....\123.exe
....\123.o
....\bin\Debug\1211.exe
....\include\queue.h
....\main.cpp
....\obj\Debug\main.o
....\queue.c
....\src\queue.cpp
....\obj\Debug\src
....\bin\Debug
....\obj\Debug
....\bin
....\include
....\obj
....\src
1211

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．