Description: 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.
To Search:
File list (Check if you may need any files):
312010080611521覃焘\实验word.doc
...................\二叉链表.cpp
312010080611521覃焘
Download