A. Grasp the basic concepts and properties of the binary tree. Master to create and construct a binary linked list algorithm. Master binary tree linked list is stored based on the three recursive traversal algorithm and non-recursive algorithm. 4. To master computing node of the binary tree algorithm of depth of the binary tree and binary tree leaf nodes. 5 Master the structure and encoding of the huffman tree. Experiments: (1) to understand the judgment of the initialization of the binary linked list, binary tree empty (2) understand the binary tree traversal algorithm, and control over their applications.

312010080611521覃焘\实验word.doc
...................\二叉链表.cpp
312010080611521覃焘

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