qq_37861955的博客

串的堆分配存储的连接代码如下：#include<stdio.h> #include<stdlib.h> #include<string.h>#define MAXSIZE 20 #define FALSE 0 #define TRUE 1 #define OK 1 #define ERROR 0typedef int Status;typedef struct{ char *ch;

进出队列代码如下#include <stdio.h> #include <stdlib.h>#define FALSE 0 #define OK 1 #define ERROR 0 #define TRUE 1 typedef struct LNode{ int data; struct LNode *next; } LNode; typedef struct LNode *Link

递增插入链表代码如下#include <stdio.h> #include <stdlib.h>#define FALSE 0 #define OK 1 #define ERROR 0 #define TRUE 1 typedef struct LNode{ int data; struct LNode *next; } LNode; typedef struct LNode *Li

进出栈代码如下#include<stdio.h> #include<stdlib.h>#define M 100typedef struct { int data[M]; int top; }SqStack; //初始化 int InitSqStack(SqStack *S) { S->top=-1; return 1; } //压栈 int PushSqStac

节点的数据结构类 public class Node { public int data; public Node left; public Node right; } 创建二叉树 /** * 创建根节点 * @return */ public static Node createRoot() { ...