**Print the Elements of a Linked List**

### Problem Statement :

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode head: a reference to the head of the list Print: 1. For each node, print its value on a new line (console.log in Javascript). Input Format: The first line of input contains n, the number of elements in the linked list. The next n lines contain one element each, the data values for each node. Note: Do not read any input from stdin/console. Complete the printLinkedList function in the editor below. Constraints: 1. 1<=n<=1000 2. 1<=list[i]<=1000

### Solution :

` ````
Solution in C :
In C:
//In hacker rank as the solution the program is too big
//all u need is to code this function.
void printLinkedList(SinglyLinkedListNode* head) {
SinglyLinkedListNode* ptr=head;
while(ptr!=NULL)
{
printf("%d\n",ptr->data);
ptr=ptr->next;
}
}
In C++:
//The rest of the code is already coded.
//As the code is too big all you need is complete the following part.
void printLinkedList(SinglyLinkedListNode* head) {
while(head!=NULL)
{
cout << head->data << "\n";
head = head->next;
}
}
In Java:
//The following part is all you to complete, the rest is
//already present in hackerrank
static void printLinkedList(SinglyLinkedListNode head) {
while(head != null) { System.out.println(head.data); head = head.next;}
}
In Python 3:
# The following part of code is all you need to
# complete the challenge in hacker rank
def printLinkedList(head):
temp = head
while (temp.next != None):
print(temp.data)
temp = temp.next
print(temp.data)
```

## View More Similar Problems

## Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →## Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →## Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →## Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →## Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →## Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →