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

Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

View Solution →

Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

View Solution →

Reverse a linked list

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio

View Solution →

Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis

View Solution →

Merge two sorted linked lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C

View Solution →

Get Node Value

This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t

View Solution →