Traversal of Singly Linked List

Singly Linked List Problems

Last Updated : 20 Oct, 2024

Singly linked list is a linear data structure in which the elements are not stored in contiguous memory locations and each element is connected only to its next element using a pointer.

Learn Basics of Singly Linked List:

Basic Operations of Singly Linked List:

Easy Problems on Singly Linked List:

Intermediate Problems on Singly Linked List:

Hard Problems on Singly Linked List:

Quick Links:

Traversal of Singly Linked List

H

harendrakumar123

Improve

Article Tags :

Practice Tags :

Linked List

Similar Reads

Singly Linked List in Python

AÂ Singly Linked ListÂ is a type of data structure that is made up of nodes that are created using self-referential structures. Each node contains a data element and a reference (link) to the next node in the sequence. This allows for a dynamic and efficient management of data elements. Table of Conte

Print Linked List

Given a Singly Linked List, the task is to print all the elements in the list.Examples:Input: 1->2->3->4->5->nullOutput: 1 2 3 4 5Explanation: Every element of each node from head node to last node is printed.Input: 10->20->30->40->50->nullOutput: 10 20 30 40 50Explanat

Traversal of Singly Linked List

Traversal of Singly Linked List is one of the fundamental operations, where we traverse or visit each node of the linked list. In this article, we will cover how to traverse all the nodes of a singly linked list along with its implementation. Examples:Input: 1->2->3->4->5->nullOutput:

Linked List Pair Sum

Given a linked list, and a number, check if their exist two numbers whose sum is equal to given number. If there exist two numbers, print them. If there are multiple answer, print any of them. Examples: Input : 1 -> 2 -> 3 -> 4 -> 5 -> NULL sum = 3 Output : Pair is (1, 2) Input : 10 -

Singly Linked List Tutorial

A singly linked list is a fundamental data structure, it consists of nodes where each node contains a data field and a reference to the next node in the linked list. The next of the last node is null, indicating the end of the list. Linked Lists support efficient insertion and deletion operations.Un

Reverse a linked list using recursion

Given a linked list, the task is to reverse the linked list by changing the links between nodes.Examples: Input: Linked List = 1 -> 2 -> 3 -> 4 -> NULL Output: 4 -> 3 -> 2 -> 1 -> NULLInput: Linked List = 1 -> 2 -> 3 -> 4 -> 5 -> NULL Output: 5 -> 4 -> 3

Sum of the nodes of a Singly Linked List

Given a singly linked list. The task is to find the sum of nodes of the given linked list. Task is to do A + B + C + D. Examples: Input: 7->6->8->4->1 Output: 26 Sum of nodes: 7 + 6 + 8 + 4 + 1 = 26 Input: 1->7->3->9->11->5 Output: 36 Recursive Solution: Call a function by

Types of Linked List

A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the

Reverse a Linked List

Given a linked list, the task is to reverse the linked list by changing the links between nodes.Examples: Input: head: 1 -> 2 -> 3 -> 4 -> NULLOutput: head: 4 -> 3 -> 2 -> 1 -> NULLExplanation: Reversed Linked List: Input: head: 1 -> 2 -> 3 -> 4 -> 5 -> NULLOut

Product of the nodes of a Singly Linked List

Given a singly linked list, the task is to find the product of all of the nodes of the given linked list.Note: For empty/ null lists, return -1.Examples: Input : List = 7->6->8->4->1Output : 1344Explanation: Product of nodes: 7 * 6 * 8 * 4 * 1 = 1344Input : List = 1->7->3->9-