![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
水平不流
这个作者很懒,什么都没留下…
展开
-
顺序栈实现序列反
stack.h 头文件#ifndef STACK_H#define STACK_H typedef int INT32;typedef char CHAR8;struct Stack{CHAR8 *p;INT32 top;INT32 max;};typedef struct Stack *Pstack;Pstack Create(INT32 N);void Pop(Pstack s);INT32原创 2013-07-03 21:29:13 · 429 阅读 · 0 评论 -
顺序栈的简单实现
queue.h头文件 #ifndef QUEUE_H #define QUEUE_H 1 typedef int INT32; typedef unsigned int UINT32; typedef unsigned char UCHAR8; typedef char CHAR8; typedef long long int LONG64; typedef unsigned long lon原创 2013-07-03 22:24:37 · 417 阅读 · 0 评论 -
链式队列简单实现
链式队列的简单实现,注释我就不写了. queue.h #ifndef QUEUE_H #define QUEUE_H 1 typedef int INT32; typedef unsigned int UINT32; typedef unsigned char UCHAR8; typedef char CHAR8; typedef long long int LONG64; type原创 2013-07-04 09:47:28 · 541 阅读 · 0 评论 -
链式栈简单实现序列反转
stack.h #ifndef STACK_H #define STACK_H 1 typedef int INT32; typedef unsigned int UINT32; typedef unsigned char UCHAR8; typedef char CHAR8; typedef long long int LONG64; typedef unsigned long long原创 2013-07-04 09:13:12 · 1018 阅读 · 0 评论 -
STL实现括号匹配
STL栈的基本操作: push(x) 将x加入栈中,即入栈操作 pop() 出栈操作(删除栈顶),只是出栈,没有返回值 top() 返回第一个元素(栈顶元素) size() 返回栈中的元素个数 empty() 当栈为空时,返回 true 下面给出一个事例供参考 括号匹配程序: #include #inclu原创 2013-07-04 11:02:34 · 652 阅读 · 0 评论 -
直接插入排序与二分查找
#include #include typedef int INT32; typedef unsigned int UINT32; typedef unsigned char UCHAR8; typedef char CHAR8; typedef long long int LONG64; typedef unsigned long long int ULONG64; typedef doubl原创 2013-07-04 11:32:51 · 455 阅读 · 0 评论 -
快速排序
main.cpp #include typedef int INT32; typedef unsigned int UINT32; typedef unsigned char UCHAR8; typedef char CHAR8; typedef long long int LONG64; typedef unsigned long long int ULONG64; typedef doub原创 2013-07-05 15:05:47 · 353 阅读 · 0 评论 -
二叉树的创建与层次遍历
Tree.h #ifndef TREE_H #define TREE_H 1 typedef int INT32; typedef unsigned int UINT32; typedef unsigned char UCHAR8; typedef char CHAR8; typedef long long int LONG64; typedef unsigned long long原创 2013-07-05 16:28:15 · 641 阅读 · 0 评论