HackerRank DSA Solutions Tutorial

Print elements of a linked list| Linked List

❮ Previous Next ❯

Task(easy)

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):

SinglyLinkedListNode head: a reference to the head of the list

Print

For each node, print its data 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<n<1000
1<list[i]<1000, where list[i] is the i element of the linked list.

Sample Input

Sample Output

16

13

Explanation

There are two elements in the linked list. They are represented as 16 -> 13 -> NULL. So, the print LinkedList function should print 16 and 13 each on a new line.

Solution 1

def printLinkedList(head):

    current = head

    while current:

        print(current.data)

        current = current.next

Explanation Steps

Initialize Current Node: Start with the head node.
Traversal Loop: Use a while loop to traverse the linked list.
- Print the data of the current node.
- Move to the next node by updating `current

❮ Previous Next ❯

HackerRank DSA Solutions Tutorial

HackerRank DSA Solutions Tutorial

HackerRank DSA Solutions

Print elements of a linked list| Linked List

Important Links