This repository contains a Python implementation of various operations on singly linked lists.
• printLL(head): Print the linked list from the given head node.
• length(head): Calculate the length of the linked list.
• insertIth(head, data, i): Insert a new node with the given data at the i-th position in the linked list.
• delete_node(head, pos): Delete a node at the specified position in the linked list.
• find_node(head, x): Find the position of a node with value x in the linked list.
• ithNode(head, i): Get the value of the node at the i-th position in the linked list.
• take_input(): Create a linked list from user-provided input.
• lastNodetoFirst(head, n): Move the last n nodes of the linked list to the beginning.
•removeDuplicate(head): Remove duplicates from a sorted linked list.
•reverse_linkedList(head): Reverse the linked list using iterative method.
•isPalindrome(head): Check if the linked list is a palindrome.
•reverse_recursion(head): Reverse the linked list using recursion.
• midpoint(head): Find the value of the midpoint node in the linked list.
• mergeTwoSortedLinkedLists(head1, head2): Merge two sorted linked lists into a single sorted linked list.