Mixzi的博客

一篇搞定稀疏数组

#include <stdio.h> typedef struct node { int data; struct node* lchild, * rchild; }BinTNode,*BinTree; void fff(BinTree BT) { BinTNode* s; if (BT) { s = BT->lchild; BT->lchild = BT->rchild; BT->rchild = s; fff(BT->lchild); .

#include <stdio.h> typedef struct node { int data; struct node* lchild, * rchild; }BinTNode; int SearchXNum(BinTNode *T,int x){ int n; if (T==NULL) { return 0; } if (T->data>=x) { n = 1; } else { n = 0; } return n + SearchXNu.

#include <stdio.h> #include <malloc.h> #define TRUE 1 #define FALSE 0 typedef struct LNode { int data; struct LNode* next; }LNode,* LinkList; int InitList(LinkList); int ListInsert(LinkList, int pos, int e); int ListDelete(LinkList, int pos,

静态数组实现 #include <stdio.h> #include <stdlib.h> #include <malloc.h> #define TURE 1 #define FALSE 0 #define MAX 10 typedef struct { int data[MAX]; int len; }SqList; void InitList(SqList*); int ListInsert(SqList*, int pos, int e); int Li.