tellsummer的博客

#include<stdio.h>#include<stdlib.h>#define STACKINITSIZE 100#define STACKINCREASESIZE 20typedef char ElemType;//树结构typedef struct tree{ ElemType data; struct tree * lchild; struct tree

/*线性表的链式存储实现*/#include<stdio.h>#include<stdlib.h>#include<malloc.h>typedef struct node{ int data; struct node *next;}Node,*pNode;//创建一个带头节点的空单链表pNode CreateListHead(void){ pNode L =

栈是限定仅在表尾进行插入或删除的线性表； 后进先出 代码如下：#include<stdio.h>#include<stdlib.h>#include<malloc.h>//定义一个节点的结构typedef struct node{ int data; struct node *pNext;}Node,*pNode;//定义栈结构typedef struct sta

代码如下#include"stdio.h"#include"malloc.h"#include"string.h"#define Maxsize 100typedef int datatype;typedef struct{ datatype stack[Maxsize]; int top;}SqStack;SqStack *InitStack(){ SqSta

代码如下#include<stdio.h>#include<stdlib.h>//二叉树的节点定义typedef struct TreeNode{ char ch; //数据域 struct TreeNode *lchild; //左孩子 struct TreeNode *rchild; //右孩子}BTNode,*PBTNod

#include<stdio.h>//定义固定大小线性表typedef struct{ int elem[100]; int lenght;}SqList;//初始化int InitList(SqList &L){ L.lenght = 0; return 1;}//插入int ListInsert(SqList &L,int i,char e){

要求时间复杂度为O(n)、空间复杂度为O(1) 实现代码如下//删除线性表中为x的元素void deleteX(SqList L,int x){ int k=0; for(i=0;i<L.lenght;i++){ if(L.elem[i]!=x){ L.elem[k]=L.elem[i]; k++;

#include<stdlib.h>//二叉树的节点定义typedef struct TreeNode{ char ch; //数据域 struct TreeNode *lchild; //左孩子 struct TreeNode *rchild; //右孩子}BTNode,*PBTNode;//先序构造二叉树void creat