weixin_43709969的博客

#include <stdio.h>#include <stdlib.h>#define minsize 10#define mindata 0struct HeapStruct;//这就是一整个堆typedef struct HeapStruct* Heap;Heap InitializeHeap(int MaxSize);void Destroy(Heap H);void MakeEmpty(Heap H);void Insert(int x, Heap H.

#include <stdio.h>#include <stdlib.h>#define MinSize 10typedef unsigned int Index;typedef Index Position;struct HashTbl;typedef struct HashTbl* HashTable;HashTable InitializeTable(int TableSize);void DestroyTable(HashTable H);Posit.

#include <stdio.h>#include <stdlib.h>#define MinSize 10struct ListNode;typedef struct ListNode* Position;struct HashTabl;typedef struct HashTbl* HashTable;struct ListNode { int element; Position next;};typedef Position List;struc.

struct AVLNode;typedef struct AVLNode* Position;typedef struct AVLNode* AT;AT MakeEmpty(AT T);Position Find(int x, AT T);Position FindMin(AT T);Position FindMax(AT T);AT Insert(int x, AT T);AT Delete(int x, AT T);struct AVLNode { int element;.

#include <stdio.h>#include <stdbool.h>#define NotAVertex -1#define NumVertex 7typedef int Vertex;typedef int DistType;typedef int WeightType;typedef struct { int i; }list;struct TableEntry { list header; int known; Vertex path; D.

要吐了，typedef东西太多了，完全记不住......#include <stdio.h>#define MaxVNum 10typedef int Vertex;typedef int WeightType;typedef struct AdjNode* EdgeListNode;struct AdjNode { Vertex NodeName; WeightType weight; struct Adjnode* next;/*是指向下一个点，但点里面不是只有no

/*根据先序遍历和中序遍历的数组结果，直接写出后序遍历的数组*//*in_head和pre_head从0开始*/void solve(int root_in_pre, int in_head, int post_head, int current_tree_len){ /*pre_head用来决定什么写入post, 递归左边就要加+1, 递归右边要加上左子树长度*/ /*in_head决定从哪里开始找，拿根节点划分更新子树长度，递归左边不用动，递归右边就要+左子树长度+1*/ /*post...

其实少了一个排序算法，但我们假设从小到大排好了。/*完全二叉搜索树，假设0用上了，注意弄清下标和个数之间的关系*/#include <math.h>int GetLeftLen(int num){ int left, temp = 1; while (temp < num) temp *= 2; /*虽然多了，但恰好是层数*/ int k = (pow(2, temp) - 1) - pow(2, temp - 2); /*k代表了左子树最后一个下标，有t层至多

/*判断两个二叉树是否同构*//*输入形式如a 1 2b 3 4c 5 -d - -e 6 -g 7 -f - -h - -*//**********************************/#define max 10#define tree int#define NULL -1#include <stdio.h>/*构建静态链表的结构数组单元*/struct TreeNode{ char data; tree left; tree right;.

要求：代码：/*完美通过先序遍历二叉树*//*输出应当为124583697*/#include <stdio.h>typedef struct TreeNode* position;struct TreeNode { int data; position left; position right;};void attatch(position a, position b);void preorder(position a);int main(void).

/*Polynomials*/#include <stdio.h>#include <stdlib.h>struct node { int coef; int exp; struct node* next;};typedef struct node* Poly;void attach(int c, int e, Poly rear){ Poly new = malloc(sizeof(struct node)); new->coef = c; n.

#define max 6struct QueueRecord;typedef struct QueueRecord* Queue;Queue Create_Queue(int maxsize);void MakeEmpty(Queue q);void DisposeQueue(Queue q);int Is_Empty(Queue q);int Is_Full(Queue q);void Enque(Queue q);int Dequeue(Queue q);struct Qu.

ptrls就是悬在外面，指明地址，本身的data没有用，这点区别强调一下。#include <stdio.h>/*用链表实现堆栈， O->O->O->O 那肯定用左边*/struct LSNode { int data; struct LSNode* next;};typedef struct LSNode* LS;/*建立空linked_stack*/LS make_empty_linked_stack(void){ LS ptrls = mallo

#include <stdio.h>#define max 20/*通常用一维数组来实现堆栈*/typedef struct SNode* stack;/*stack->stack*/struct SNode { int data[max]; int top;/*下标,就是最后一个数，不是指向它后面的空位置*/};/*建立空栈*/stack make_empty_stack(void){ stack ptrs = malloc(sizeof(struct SNode.

#include <stdio.h>/*链表的一般实现*/typedef struct LNode* list;struct LNode { int value; struct LNode* next;};/*建立一个空表*/list make_empty(void) { list head = malloc(sizeof(struct LNode)); head->next = NULL; return;}/*求表长*/int length(list p.

链表的数组实现#include <stdio.h>/*链表的数组实现*/#define max 20typedef struct LNode* list;struct LNode { int data[10];/*假设有10个*/ int last;/*从0开始，是数组下标，不是第几个位置*/};/*建立空表*/list make_empty(void){ list ptrL; ptrL = malloc(sizeof(struct LNode)); ptrL