Tags » Linked List

Operations on Linked List

//Creating a linked list and inserting the elements at any position
//Deleting any element from a linked list
//Reversing the linked list
void insert(int); 463 more words

Linked List

Circular Linked List

/*Create a circular linked list having information about a college and perform insertion at the front and perform deletion at the end */

#include<process.h> 337 more words

Data Structure

Nth Node From the End of a Linked List

The aim is to find the nth node from the end of a linked list.
For example-
1 –>2 –>3 –>4 –>5 –>6 –>7
For n = 3, 3rd node from the end is 5… 453 more words

Linked List

Doubly Linked List – Insert at Specified Position

First to insert, we need to allocate memory to the new node we need to insert.

struct linkedlistnode *newNode = (struct linkedlistnode *) malloc(size of (struct linkedlistnode)) 345 more words

Linked List

Doubly Linked List

struct node{
int data;
struct node *next,*prev;
void main(){
int ch,n;
printf(“\n\n 1.PUSH \n 2.POP \n 3.Traverse \n 4.Exit\n”); 483 more words

Linked List

Delete Node in a Linked List



Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. 65 more words


Palindrome Linked List



Given a singly linked list, determine if it is a palindrome.

Follow up:
Could you do it in O(n) time and O(1) space? 356 more words