笔记
山川き
这个作者很懒,什么都没留下…
展开
-
堆排序算法实现(最大堆)
最大堆排序#include <stdio.h>#include<string.h>#include<stdlib.h>#include<time.h>const int MAX = 0x3f3f3f3f;const int maxn = 1000;typedef struct HeapStruct *MaxHeap;struct HeapStruct { int data[maxn]; int Size; int Ca原创 2020-11-20 18:48:06 · 97 阅读 · 0 评论 -
二叉搜索树
#include <stdio.h>#include<string.h>#include<stdlib.h>#include<time.h>typedef struct tree *BT;struct tree{ int data; struct tree *left; struct tree *right;}Bintree;typedef struct SNode* Stack;struct SNode { BT原创 2020-11-15 16:44:48 · 62 阅读 · 0 评论