ilikeprograming的专栏

#include "stdio.h"#include "stdlib.h"typedef struct List { int data; //数据域 struct List *next; //指针域} List;void TailCreatList(List *L) //尾插法建立链表{ List *s, *r;//s用来指向新生成的节点。r始终指向L的终端节点。 r = L;

#include "stdio.h"#include"malloc.h"//二叉树节点typedef struct BiTNode { char data; struct BiTNode *lchild, *rchild;//这里的*BiTree其实不一定要定义//定义BiTNode就够了//在代码中表示树可以这么写：BiTNode *t;} BiTNode, *BiTree;

算法演示可以参见这里：http://sjjg.js.zwu.edu.cn/SFXX/sf1/zxxsh.html#include "string.h"#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"/*线索二叉树----Threaded Binary Tree * 二叉树线索化的目的是更好

#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */typedef int Status; /* Stat

#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */typedef int Status; /* Stat

#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */

有一个带头结点的单链表L={a1,b1,a2,b2,...,an,bn},设计一个算法将其拆分成两个带头结点的单链表A和B，正序链表A={a1,a2,a3...,an},逆序链表B={bn,bn-1,,...b1}.要求链表A使用链表L的头结点。#include "stdio.h"#include "stdlib.h"//节点typedef struct List { i

import java.util.*;/** * * Title: 哈希表操作 * * * Description: 这是一个权限认证的例子，使用了哈希表作为数据的存储 * * * Copyright: Copyright (c) 2003 * * * Filename: RoleRight.java * * * @author 杜江 * @ve

#include#include#define max 100char ex[max]; /*存储后序表达式*//*函数功能：将中序表达式转化为后序表达式*/void trans() { char str[max]; /*表达式字符串*/ char stack[max]; /*运算符栈*/ char ch; /*当前字符*/ int sum,

转载自：http://blog.youkuaiyun.com/sunmeng_007/article/details/8095224#include//定义节点typedef struct btnode{ char value; struct btnode *left; struct btnode *right;}btnode;//该函数的作用是：返回在中序遍历序列数组中

#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */#define MAX_TREE_SIZE 100 /

#include "string.h"#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 1

#include "stdio.h"#include "string.h"#include "ctype.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /*

#include "string.h"#include "ctype.h"#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 1000 /* 存储

/* f.c 用函数指针代替C++的引用参数 */ #include void fa(int a) /* 在函数中改变a，将不会带回主调函数(主调函数中的a仍是原值) */ { a=5; printf("在函数fa中：a=%d\n",a); } void fb(int *a) /* a为指针类型，在函数中改变*a，改变后的值将带回主调函数 */ { *a=5;

#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */typedef int Status;typedef i

#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */typedef int Status;typedef in

#include#include#include#include#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 //存储空间初始分配量typedef int Status; //函数的类型typedef int ElemType;//顺序表中元素的类型typedef s

#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */typedef int Status;typede

#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */typedef int Status;ty

#include "string.h"#include "stdio.h"#include "stdlib.h"#include "math.h"#include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 40 /* 存储空间初始分配量 */typedef

《数据结构与算法的问题与实验》例子