Rosetta Code talk:Add a Task: Difference between revisions

No edit summary
Line 13:
We can traverse the list in this way until we find any node containing null or -1 in its next part.
 
== My own C++ linkedlist implementation by me ==
 
 
== //- University of Delhi
//- by Manish Natraj shohbby
// - c++ list
#include <iostream>
#include <cstdlib>