C++数据结构
乱乱乱世
不是因为有希望才坚持,而是因为坚持才会有希望。
展开
-
【C++数据结构】二叉树
BTree.h#pragma onceclass CNode{public: int data; CNode *lNode; CNode *rNode;public: CNode(); ~CNode();};class CBTree{public: CBTree(); ~CBTree();public: CNode *he原创 2016-10-09 16:44:15 · 280 阅读 · 0 评论 -
【C++数据结构】单链表
C++单链表的实现SingleLinkedList.h#pragma once#include <iostream>using namespace std;// 单链表class CList{public: int Data; CList *next;public: CList(); ~CList();};class CSingleLinkedList原创 2016-09-27 17:01:44 · 378 阅读 · 0 评论 -
【C++数据结构】循环双向链表
循环双向链表 DoubleLinkedList.h#pragma once#include <iostream>using namespace std;class CList {public: CList(); ~CList();public: int Data; CList *Next; CList *Forward;};class CDoub原创 2016-09-28 16:57:13 · 390 阅读 · 0 评论 -
【C++数据结构】动态数组栈的实现
动态数组栈的实现 Stack.h#pragma onceclass Stack{public: Stack(); ~Stack();private: int top = 0; int end = 0;private: int MaxSize=10; const int increase = 10;private: bool isEmp原创 2016-10-08 10:51:20 · 1142 阅读 · 0 评论 -
【C++数据结构】数组循环队列的实现
Queue.h#pragma onceclass Queue{private: int MaxSize = 10; int *queue;private: int front = 0; int rear = 0;public: Queue(); ~Queue();private: bool isEmpty(void); boo原创 2016-10-08 16:08:09 · 386 阅读 · 0 评论 -
【C++数据结构】模板链栈
Stack.htemplate<class T>class Link {public: Link();public: T data = NULL; Link* next = nullptr;};template<class T>class CStack{public: CStack(); ~CStack();private: Link<T原创 2017-03-13 20:30:38 · 297 阅读 · 0 评论 -
【数据结构与算法】带权有向图
MyGraph.h#pragma once#include <iostream>#include <stack>#include <queue>using namespace std;// 邻接矩阵// 带权有向图const int MAXSIZE = 20;const int INFINITE = 100;template <class T>class CMyGraph{publ原创 2017-04-10 19:27:42 · 6410 阅读 · 0 评论 -
【C++数据结构】动态数组
DynamicArray.h#pragma once#include <iostream>using namespace std;template <class T>class CDynamicArray{public: CDynamicArray(); ~CDynamicArray();private: int Size = 5; int Length原创 2017-03-16 20:53:23 · 334 阅读 · 0 评论 -
【C++数据结构】哈夫曼树代码实现
HuffeManTree.h#pragma once#include "Stack.h" // 我自己写的栈#include "Stack.cpp"template<class T>class CTree {public: CTree(void);public: T data = NULL; int weight = 1; CTree* lNode = nu原创 2017-03-14 21:00:59 · 3679 阅读 · 0 评论