Data Structure
文章平均质量分 81
Non_Recursive
对技术的狂热,对技术的执著,对未来美好生活的向往......
展开
-
Implement a single linklist
//LinkList.h #include using namespace std;templatetypename T>//Node for LinkList struct Node{ T data; Node* next; //the link for next node Node(Node* ptr=NUL原创 2008-11-14 15:29:00 · 590 阅读 · 0 评论 -
two versions of implement of stack
//two versions of implement of stack #include #include using namespace std;/*templateclass Stack{ vector elems; //elements;public: void Push(T const&);原创 2008-11-17 20:59:00 · 655 阅读 · 0 评论 -
simple version of stack and queue 's ADT
//Stack templateclass datatype>class stack{public: static const int MAXSIZE = 100; stack() : top(0) { } bool empty() const { return top == 0; }转载 2008-11-17 21:22:00 · 499 阅读 · 0 评论 -
Implement Binary Search Tree
//BSTree.h #include using namespace std;templatetypename Elem>struct BSTNode //implement BSTs node { BSTNode *left,*right; Elem data; BSTNode(Elem dataVal,BSTNode*原创 2008-11-14 15:25:00 · 608 阅读 · 0 评论 -
Implement a undirected graph,represent by a adjacent matrix
and this a undirected graph represent by adjacent list..http://blog.csdn.net/Non_Recursive/archive/2008/11/26/3377728.aspx //MatrixGraph.h #include using namespace std; con原创 2008-11-21 12:53:00 · 1119 阅读 · 0 评论 -
implement a undirected graph use adjacent list
I had wire a undirectded graph use adjacent matrix,have a look ^_^ ...http://blog.csdn.net/Non_Recursive/archive/2008/11/21/3345183.aspx and this a undirected graph represent by adjacent list.原创 2008-11-26 10:52:00 · 960 阅读 · 0 评论 -
implement a AVL tree use c++ (Non_Recursive),write by baihacker
//by baihacker //link: http://blog.csdn.net/baihacker/archive/2008/08/20/2803385.aspx#define BALANCE_CHECK #ifndef NULL #define NULL 0 #endif /* Default Value Contr转载 2008-11-28 17:32:00 · 773 阅读 · 0 评论 -
HeapSort,use maximun heap...
/*建议大家到这看:http://topic.csdn.net/u/20081129/21/81fb7e89-0df5-4911-9884-d05680705a3c.html*/#include #include using namespace std;const int DefaultSize = 100;class MaxHeap原创 2008-11-30 13:02:00 · 609 阅读 · 0 评论 -
implementation of Vector (using C++)
The Vector will be a first-class type,meaning that unlike the primitive array in C++,the Vector can be cpoied,and the memory it uses can be automatically reclaimed(via its destructor). First,reca原创 2009-09-28 12:13:00 · 1200 阅读 · 0 评论