Sorted Linked List Problem
i was looking over my program again, and i found out that it lets you insert more than 2 numbers on specific situations. Lets say you insert a 1, and then a 12. you can then insert numbers lower than a 12 in there and they will go in, but if you insert a 13, it will overwrite the 12, and then there will only be 2 numbers again. Another thing is, i dont think the transversal is checking throuhg the entire linked list, it only compares it with the first node in the list, and i dont get how to compare it to all the nodes in the list.
to email me, email me at DRFUNKENSTINE@aol.com
and heres a link to my C++ program
the while loop in the insert function is on line 00160: youll know what im talking about when you see the page.