**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

## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →## Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →## Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →## Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →## Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →## Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →