In this paper, a simple C language binary tree, each node only stores an integer, and, due to the very simple, is to determine the root of the tree, not imported. Determine the root after each number entered by the user are insert into the tree (-999 means stop), the use of depth-first approach. After the establishment of good binary tree, respectively, using depth-first (DFS) and breadth first (BFS) for the traverse,

erchashu\BiTree.h
........\BiTreeNode.h
........\主程序.cpp
erchashu

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