msaimraz / hacktoberfest_2023 Goto Github PK

Write a function to delete a node in a singly-linked list. You will not be given access to the head of the list instead, you will be given access to the node to be deleted directly. It is guaranteed that the node to be deleted is not a tail node in the list.

Given two singly linked lists that are sorted in increasing order of node values, merge two sorted linked lists and return them as a sorted list. The list should be made by splicing together the nodes of the first two lists.

Given the head of a singly linked list, write a program to reverse the linked list, and return the head pointer to the reversed list.