Judgment tree, first determine the number of elements with a high degree of complete binary tree is not in line with the law, does not meet the FALSE. After traversing the hierarchical method, the difference is encountered also put NULL, when the teams met the first NULL jump. If, after the whole team is NULL, then a complete binary tree, otherwise not.

btree.h
main.cpp
queue.h
readme.txt
zhan.h

• 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．