Traversing a linked list in C++ : Linked List – 2

Question. We wish to traverse (and print the data) in a singly linked list.

Solution.

One could proceed as follows:

——

void traverse ( Node *head)

{

Node *curr = head;

while ( ! curr)

{

cout << curr->data << endl;

curr = curr -> next;

}

}

——

Traversal takes time linear in the length of the list.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: