这是数据结构基础算发知识的VC实现 如二叉树遍历、拓扑排序、哈夫曼树等-This data structure is based on the operator's knowledge of VC as binary tree traversal, topological sorting, Huffman tree;