数据结构
文章平均质量分 79
搞什么猫腻
这个作者很懒,什么都没留下…
展开
-
赫夫曼树(从叶子到根逆向求每个字符)
#include#include#include#includetypedef struct{ unsigned int weight; unsigned int parent,lchild,rchild;}HTNode,*HuffmanTree;typedef char **HuffmanCode;void Select(HuffmanTree HT, int u, int &原创 2018-05-09 20:57:47 · 820 阅读 · 0 评论 -
堆排序
#include "stdio.h"#include "stdlib.h"#include "time.h"#define MAXSIZE 100typedef int Status;typedef int KeyType;typedef int infoType;typedef struct { KeyType key; infoType otherinfo;}RedType原创 2018-05-09 21:00:13 · 147 阅读 · 1 评论