Printable View
why is my linked list printing out backwards?
Code:#include <iostream.h>
#include <stdlib.h>
using namespace std;
typedef struct node
{
int a;
node *next;
}NODE;
int main()
{
NODE *current = NULL;
for (int i = 0; i < 5; i++)
{
node *newnode = new node;
cout << "input a value: ";
cin >> newnode->a;
newnode->next = current;
current = newnode;
}
node *show = current;
while (show != NULL)
{
cout << show->a << endl;
show = show->next;
}
system("PAUSE");
return 0;
}
Because you are adding your new nodes to the beginning of the list instead of at the end. When you start to output your list you end up with the beginning being the last node you added.
newbie question:
how would u change that around?
ah, its suppose to be printing like that...
now to figure out the linked list sort...
instead of setting the node your inserting's next to null, set it to the head -> next...Quote:
Originally posted by revelation437
newbie question:
how would u change that around?
i dont fully understand :(Quote:
Originally posted by Jamsan
instead of setting the node your inserting's next to null, set it to the head -> next...
basically, if there's nothing in the list, just set the header to the current node, and then the current -> next to NULL....if theres something in the list, you need to set the current header node, to the node your adding's next.....so basically you haveCode:if (m_Head == NULL) //If the list is empty (head is null)
{
m_Head = T;
T -> next = NULL;
}
else
{
T -> next = m_Head;
m_Head = T;
}
Head -> node0 -> node 1....now you wanna add node 2 to the beginning....so you have to, Head -> node2 -> node0 -> node1....you have to set node0 to node2-> next, so the list isnt broken, and then the head to the new node.