Class List

[tuandt5]

please help me finish the function
List::OrderInsert(T item)
to insert data into list sequentially

// List.h
#pragma once

template <class T>
class List
{
private:

	class Node
	{
	public:
		T info;
		Node *prev, *next;
	public:
		Node(T info): info(info) { prev = next = NULL; }
	} *head, *tail;

	int count;

private:
	void Prepend(Node *p)
	{
		if (this->head == NULL)
		{
			this->tail = p;
		}
		else
		{
			p->next = this->head;
			this->head->prev = p;
		}
		this->head = p;
		count++;
	}

	void Append(Node *p)
	{
		if (this->tail == NULL)
		{
			this->head = p;
		}
		else
		{
			p->prev = tail;
			this->tail->next = p;
		}
		this->tail = p;
		count++;
	}

	void InsertBefore(Node *q, Node *p)
	{
		p->prev = q->prev;
		p->next = q;
		q->prev = p;
		count++;
	}

	void InsertAfter(Node *q, Node *p)
	{
		p->next = q->next;
		p->prev = q;
		q->next = p;
		count++;
	}

	void Remove(Node *p)
	{
		Node *next = p->next;
		Node *prev = p->prev;

		if (p == this->head) this->head = next;
		if (p == this->tail) this->tail = prev;
		delete p;

		if (next != NULL) next->prev = prev;
		if (prev != NULL) prev->next = next;
		count--;
	}

public:
	List() : count(0) { head = tail = NULL; }
	~List()
	{
		this->Clear();
	}

public:
	bool IsEmpty() { return this->head == NULL; }
	void Clear()
	{
		Node *p = this->head;
		while (p != NULL)
		{
			this->head = p->next;
			delete p;
			p = this->head;
		}
		count = 0;
	}

public:
        void OrderInsert(T item)
          {
          ///////////// Insert code here
           ///////////// to insert data into the List sequentially
          }
	void PushBegin(T item) { Prepend(new Node(item)); }
	
	void PushEnd(T item) { Append(new Node(item)); }
	
	T PopBegin()
	{
		T info = this->head->info;
		Remove(head);
		return info;
	}

	T PopEnd()
	{
		T info = this->tail->info;
		Remove(tail);
		return info;
	}

	void InsertAt(T info, int index)
	{
		Node *p = new Node(info);

		if (index == 0 || q == NULL)
			Prepend(p);
		else
		{
			if (index >= this->count)
				Append(p);
			else
			{
				Node *q = this->head;
				while (index > 0)
				{
					index--;
					q = q->next;
				}
				InsertBefore(q, p);
			}
		}
	}

	void RemoveAt(int index)
	{
		if (index == 0)
			Remove(head);
		else
		{
			if (index >= this->count)
				Remove(tail);
			else
			{
				Node *q = this->head;
				while (index > 0)
				{
					index--;
					q = q->next;
				}
				Remove(q);
			}
		}
	}
};

[hamsterman]

pseudocode:

node n = head;
while value of node n is less than value of item, go to next node;
insert a new node with value of item before n;//note: this line is not in a loop 

it would be a bit more difficult if tis wasn't a doubly linked list.

[tuandt5]

thank "hamsterman"
are you a professional programmer ?
i see you can answer any the quetions.