Changed all classes structure, move implementation into .cpp files and created Makefiles; Write Tree->BinTree convert function.

Author: Time-Coder

List/CircList/Makefile

@@ -0,0 +1,16 @@
+INCLUDE := -I.
+DEPEND := main.cpp circlist.h circlist.cpp
+
+all: main
+
+main: $(DEPEND)
+	g++ -Wall -std=c++11 -g $(INCLUDE) main.cpp -o main
+
+run: main
+	main
+
+gdb: main
+	gdb -q main.exe
+
+clean:
+	del main.exe

List/circlist.h renamed to List/CircList/circlist.cpp

@@ -1,112 +1,4 @@
-#ifndef CIRCLIST_H
-#define CIRCLIST_H
-
-#include <iostream>
-
-using namespace std;
-
-template<typename DataType>
-class CircList
-{
-	friend ostream & operator <<(ostream& out, const CircList<DataType>& list) // tested
-	{
-		out << endl;
-		CircList<DataType>::iterator it = list.begin();
-		for(int i = 0; i < list.size(); i++, it++)
-		{
-			out << (*it) << endl;
-		}
-
-		return out;
-	}
-
-private:
-	class Node
-	{
-	public:
-		DataType data;
-		Node *link = NULL;
-
-		Node(){}
-		Node(DataType element): data(element){}
-		Node(Node *ptr): link(ptr){}
-		Node(DataType element, Node *ptr): data(element), link(ptr){}
-		~Node(){link = NULL;}
-	}*first = NULL, *rear = NULL;
-	int length = 0;
-
-private:
-	Node* creat_node()const;
-	Node* creat_node(DataType element)const;
-	Node* creat_node(DataType element, Node* ptr)const;
-	Node* creat_node(Node* node)const;
-	void memory_error(Node* p)const;
-	
-public:
-	class iterator
-	{
-	public:
-		Node* ptr = NULL;
-
-	public:
-		iterator(){}
-		iterator(Node* p): ptr(p){}
-		iterator(const iterator& it): ptr(it.ptr){}
-		~iterator(){ptr = NULL;}
-		iterator& operator =(const iterator& it){ptr = it.ptr; return *this;}
-		bool operator ==(const iterator& it){return (ptr == it.ptr);}
-		bool operator !=(const iterator& it){return (ptr != it.ptr);}
-		DataType& operator *(){return ptr->data;}
-		iterator& operator ++(){ptr = ptr->link; return *this;}
-	    iterator operator ++(int){iterator it_temp = *this; ptr = ptr->link; return it_temp;}
-	};
-
-	class const_iterator
-	{
-	public:
-		Node* ptr = NULL;
-
-	public:
-		const_iterator(){}
-		const_iterator(Node* p): ptr(p){}
-		const_iterator(const iterator& it): ptr(it.ptr){}
-		const_iterator(const const_iterator& it): ptr(it.ptr){}
-		~const_iterator(){ptr = NULL;}
-		const_iterator& operator =(const iterator& it){ptr = it.ptr;return *this;}
-		const_iterator& operator =(const const_iterator& it){ptr = it.ptr;return *this;}
-		bool operator ==(const iterator& it){return (ptr == it.ptr);}
-		bool operator ==(const const_iterator& it){return (ptr == it.ptr);}
-		bool operator !=(const iterator& it){return (ptr != it.ptr);}
-		bool operator !=(const const_iterator& it){return (ptr != it.ptr);}
-		DataType operator *(){return ptr->data;}
-		const_iterator& operator ++(){ptr = ptr->link; return *this;}
-	    const_iterator operator ++(int){const_iterator it_temp = *this; ptr = ptr->link; return it_temp;}
-	};
-
-public:
-	CircList<DataType>(){}; // tested
-	CircList<DataType>(int n); // tested
-	CircList<DataType>(int n, DataType element); // tested
-	CircList<DataType>(const CircList<DataType>& list); // tested
-	~CircList<DataType>(); // tested
-	void clear(); // tested
-	CircList<DataType>& operator =(const CircList<DataType>& list); // tested
-	int size()const; // tested
-	bool empty()const; // tested
-	DataType& operator [](int i); // tested
-	DataType operator [](int i)const; // tested
-	int locate(DataType element)const;
-	void insert(int n, DataType element); // tested
-	bool erase(int n); // tested
-	void push_back(DataType element); // tested
-	void push_front(DataType element); // tested
-	DataType pop_back(); // tested
-	DataType pop_front(); // tested
-	bool swap(int i, int j); // tested
-	CircList<DataType> cat(const CircList<DataType>& list); // tested
-	iterator begin()const{return iterator(first);}
-	iterator last()const{return iterator(rear);}
-};
+#ifdef CIRCLIST_H
 
 template<typename DataType>
 void CircList<DataType>::memory_error(CircList<DataType>::Node* p)const
@@ -120,7 +12,7 @@ void CircList<DataType>::memory_error(CircList<DataType>::Node* p)const
 }
 
 template<typename DataType>
-typename CircList<DataType>::Node* CircList<DataType>::creat_node()const
+typename CircList<DataType>::Node* CircList<DataType>::new_Node()const
 {
 	CircList<DataType>::Node* p = new CircList<DataType>::Node;
 	memory_error(p);
@@ -129,7 +21,7 @@ typename CircList<DataType>::Node* CircList<DataType>::creat_node()const
 }
 
 template<typename DataType>
-typename CircList<DataType>::Node* CircList<DataType>::creat_node(DataType element)const
+typename CircList<DataType>::Node* CircList<DataType>::new_Node(DataType element)const
 {
 	CircList<DataType>::Node* p = new CircList<DataType>::Node(element);
 	memory_error(p);
@@ -138,7 +30,7 @@ typename CircList<DataType>::Node* CircList<DataType>::creat_node(DataType eleme
 }
 
 template<typename DataType>
-typename CircList<DataType>::Node* CircList<DataType>::creat_node(DataType element, CircList<DataType>::Node* ptr)const
+typename CircList<DataType>::Node* CircList<DataType>::new_Node(DataType element, CircList<DataType>::Node* ptr)const
 {
 	CircList<DataType>::Node* p = new CircList<DataType>::Node(element, ptr);
 	memory_error(p);
@@ -147,7 +39,7 @@ typename CircList<DataType>::Node* CircList<DataType>::creat_node(DataType eleme
 }
 
 template<typename DataType>
-typename CircList<DataType>::Node* CircList<DataType>::creat_node(CircList<DataType>::Node *node)const
+typename CircList<DataType>::Node* CircList<DataType>::new_Node(CircList<DataType>::Node *node)const
 {
 	CircList<DataType>::Node* p = new CircList<DataType>::Node(node->data);
 	memory_error(p);
@@ -169,11 +61,11 @@ CircList<DataType>::CircList(int n)
 		return;
 	}
 
-	first = creat_node();
+	first = new_Node();
 	CircList<DataType>::Node* p = first;
 	for(int i = 1; i < n; i++)
 	{
-		p->link = creat_node();
+		p->link = new_Node();
 		p = p->link;
 	}
 	p->link = first;
@@ -195,11 +87,11 @@ CircList<DataType>::CircList(int n, DataType element)
 		return;
 	}
 
-	first = creat_node(element);
+	first = new_Node(element);
 	CircList<DataType>::Node* p = first;
 	for(int i = 1; i < n; i++)
 	{
-		p->link = creat_node(element);
+		p->link = new_Node(element);
 		p = p->link;
 	}
 	p->link = first;
@@ -215,12 +107,12 @@ CircList<DataType>::CircList(const CircList<DataType>& list)
 		return;
 	}
 
-	first = creat_node(list.first);
+	first = new_Node(list.first);
 	CircList<DataType>::Node *p = first;
 	CircList<DataType>::Node *q = list.first;
 	for(int i = 1; i < list.length; i++)
 	{
-		p->link = creat_node(q->link);
+		p->link = new_Node(q->link);
 		p = p->link;
 		q = q->link;
 	}
@@ -273,12 +165,12 @@ CircList<DataType>& CircList<DataType>::operator =(const CircList<DataType>& lis
 		return *this;
 	}
 
-	first = creat_node(list.first);
+	first = new_Node(list.first);
 	CircList<DataType>::Node *p = first;
 	CircList<DataType>::Node *q = list.first;
 	for(int i = 1; i < list.length; i++)
 	{
-		p->link = creat_node(q->link);
+		p->link = new_Node(q->link);
 		p = p->link;
 		q = q->link;
 	}
@@ -364,7 +256,7 @@ void CircList<DataType>::insert(int n, DataType element)
 {
 	if(length == 0)
 	{
-		first = creat_node(element);
+		first = new_Node(element);
 		first->link = first;
 		rear = first;
 		length = 1;
@@ -379,19 +271,19 @@ void CircList<DataType>::insert(int n, DataType element)
 
 	if(n == 0)
 	{
-		rear->link = creat_node(element, first);
+		rear->link = new_Node(element, first);
 		first = rear->link;
 	}
 	else if(ni == 0)
 	{
-		rear->link = creat_node(element, first);
+		rear->link = new_Node(element, first);
 		rear = rear->link;
 	}
 	else
 	{
 		CircList<DataType>::Node *p = first;
 		for(int i = 0; i < ni-1; i++, p = p->link){}
-		p->link = creat_node(element, p->link);
+		p->link = new_Node(element, p->link);
 	}
 	length++;
 }
@@ -442,14 +334,14 @@ void CircList<DataType>::push_back(DataType element)
 {
 	if(length == 0)
 	{
-		first = creat_node(element);
+		first = new_Node(element);
 		first->link = first;
 		rear = first;
 		length = 1;
 		return;
 	}
 
-	rear->link = creat_node(element, first);
+	rear->link = new_Node(element, first);
 	rear = rear->link;
 	length++;
 }
@@ -459,14 +351,14 @@ void CircList<DataType>::push_front(DataType element)
 {
 	if(length == 0)
 	{
-		first = creat_node(element);
+		first = new_Node(element);
 		first->link = first;
 		rear = first;
 		length = 1;
 		return;
 	}
 
-	rear->link = creat_node(element, first);
+	rear->link = new_Node(element, first);
 	first = rear->link;
 	length++;
 }
@@ -629,7 +521,7 @@ CircList<DataType> CircList<DataType>::cat(const CircList<DataType>& list)
 	CircList<DataType>::Node *p = list.first;
 	for(int i = 0; i < list.length; i++)
 	{
-		rear->link = creat_node(p);
+		rear->link = new_Node(p);
 		rear = rear->link;
 		p = p->link;
 	}
@@ -638,4 +530,24 @@ CircList<DataType> CircList<DataType>::cat(const CircList<DataType>& list)
 	return *this;
 }
 
+template<class DataType>
+ostream & operator <<(ostream& out, const CircList<DataType>& list)
+{
+	if(list.empty())
+	{
+		return out;
+	}
+
+	int n = list.size();
+	typename CircList<DataType>::iterator it = list.begin();
+	out << (*it);
+	it++;
+	for(int i = 1; i < n; i++, it++)
+	{
+		out << ", " << (*it);
+	}
+
+	return out;
+}
+
 #endif