posted             

code:

---

class List
{
public:
    List( /* in */ const char dataLine[] );
    ~List( );
    void PrintList( ) const;
    void ReversePrintList( ) const;
private:
    struct Node
    {
        char  item;
        Node* next;
    };

    Node* front;
	

};

List::List( /* in */ const char dataLine[] )
{
	
	
	int temp = strlen(dataLine);

	for ( int counter = 0; counter < temp; counter++)
	{
		front = new Node;
		front->item = dataLine[counter];		
		front->next = front;


		cout << front->item << endl;
	}

}

---

IP: Logged | 

posted                   

quote:

---

for some reason its making a circular linked list by pointing to itself

---

Posts: 10645 | Registered: Jul 2004  |  IP: Logged | 

posted                  

quote:

---

Originally posted by MrSquicky:
It's important to keep in mind that a linked list should generally also end (i.e. have its last node pointing to nothing).

---

Posts: 7021 | Registered: Nov 1999  |  IP: Logged | 

posted             

code:

---

List::List( /* in */ const char dataLine[] )
{
	Node* current;

	front = new Node;
	front->item = dataLine[0];


	int temp = strlen(dataLine);
	
	for ( int counter = 1; counter < temp; counter++)
	{

		current = front;
		
		Node* newPtr;
		newPtr = new Node;

		newPtr->item = dataLine[counter];

		*while ( current->next != NULL )
		{
			// stuff
			current = current->next;

		}

		current->next = newPtr;

		
		cout << newPtr->item << endl;
		
	}

}

---

IP: Logged |