Write a program to insert or delete a node from doubly linked list?

Answer 1

Encoder:- In character recognition, that class of printer which is usually designed for the specific purpose of printing a particular type font in predetermined positions on certain size forms.

(electronics) In an electronic computer, a network or system in which only one input is excited at a time and each input produces a combination of outputs. encoder http://www.answers.com/main/Record2?a=NR&url=http%3A%2F%2Fcommons.wikimedia.org%2Fwiki%2FImage%3AEncoder%2520diagram.svg http://www.answers.com/main/Record2?a=NR&url=http%3A%2F%2Fcommons.wikimedia.org%2Fwiki%2FImage%3AEncoder%2520diagram.svg Circuit diagram of a single bit 4-to-2 line encoder A3A2 A1 A0 F1 F0 0 0 0 1 0 0 0 0 1 0 0 1 0 1 0 0 1 0 Encoder:- In character recognition, that class of printer which is usually designed for the specific purpose of printing a particular type font in predetermined positions on certain size forms.

(electronics) In an electronic computer, a network or system in which only one input is excited at a time and each input produces a combination of outputs. encoder http://www.answers.com/main/Record2?a=NR&url=http%3A%2F%2Fcommons.wikimedia.org%2Fwiki%2FImage%3AEncoder%2520diagram.svg http://www.answers.com/main/Record2?a=NR&url=http%3A%2F%2Fcommons.wikimedia.org%2Fwiki%2FImage%3AEncoder%2520diagram.svg Circuit diagram of a single bit 4-to-2 line encoder A3A2 A1 A0 F1 F0 0 0 0 1 0 0 0 0 1 0 0 1 0 1 0 0 1 0 1 0 0 0 1 1 Truth table

Answer 2

#include "stdio.h"

#include "alloc.h"

typedef struct dubll

{

int data;

struct dubll *leftlink,*rightlink;

}*DUBLL;

DUBLL high,temp_node,low,last,pntr;

int flag=0;

DUBLL NodeAlloc();

DUBLL Search(int,int);

void CreateItem();

void AppendItem();

void PrintItem();

void DeleteItem();

DUBLL Search(int item,int flag);

DUBLL NodeAlloc();

void InsertItem();

void main(void)

{

int choice,Item;

high=NULL;

while(1)

{

clrscr();

printf("\n \t\t\t***** M A I N M E N U *****\n\n");

printf("\n 1: Create Linked List \n 2: Append a Node to the List \n 3: Traverse the List \n 4: Delete a Node from the List \n 5: Search a Node \n 6: Insert a Node to the List \n 7: Close \n\n\t\t Enter your Option [ ]\b\b");

scanf("%d",&choice);

switch(choice)

{

case 1:

CreateItem();

puts("\nPress any key to go back to main menu.");

getch();

break;

case 2:

AppendItem();

break;

case 3:

PrintItem();

puts("\nPress any key to go back to main menu.");

getch();

break;

case 4:

DeleteItem();

break;

case 5:

printf("Find an Item: ");

scanf("%d",&Item);

temp_node=Search(Item,0);

if(temp_node)

{

puts("The item is available in the Linked List.");

}

else

{

puts("The item is not found in the Linked List.");

}

getch();

break;

case 6:

InsertItem();

break;

case 7:

exit();

default:

puts("Invalid choice.");

puts("\nPress any key to go back to main menu.");

getch();

break;

}

}

}

/* Function to Create the list*/

void CreateItem()

{

if(high==NULL)

{

printf("\n -Creating the list-");

temp_node=NodeAlloc();

printf("\n Enter starting data (as integer value) :");

scanf("%d",&temp_node->data);

high=temp_node;

}

else{ printf("\n List already created @ %d with %d as data.",high,high->data);}

}

/* Function to Append items to the list*/

void AppendItem()

{

low=high;

if(high==NULL)

{

CreateItem();

}

else

{

temp_node=NodeAlloc();

printf("\n Enter Item (in integer) :");

scanf("%d",&temp_node->data);

temp_node->rightlink=NULL;

while(low->rightlink!=NULL)

low=low->rightlink;

low->rightlink=temp_node;

temp_node->leftlink=low;

last=low->rightlink;

}

}

/* Function to Traverse the list both ways and print the data*/

void PrintItem()

{

DUBLL temp_node;

if(high==NULL)

{

printf("\n List is not available. Please create a list first.");

getch();

CreateItem();

}

temp_node=high;

last=low->rightlink;

printf("\n-Printing The List In Forward direction-\n");

while(temp_node!=NULL) //In forward direction

{

printf("\t %d",temp_node->data);

temp_node = temp_node->rightlink;

}

printf("\n");

printf("\n-Printing The List In Backward direction-\n");

temp_node=high;

if(temp_node->rightlink==NULL){printf("%d",temp_node->data);return; }

while(last!=NULL) //In backward direction

{

printf("\t %d",last->data);

last = last->leftlink;

}

}

/* Function to Delete items of the list*/

void DeleteItem()

{

int value;

DUBLL temp_node;

if(high==NULL)

{

printf("\n List is not available. Please create a list first.");

getch();

CreateItem();

}

printf("\n Item to delete :");

scanf("%d",&value);

pntr=Search(value,1);

pntr->leftlink->rightlink=pntr->rightlink;

pntr->rightlink->leftlink=pntr->leftlink;

temp_node=pntr;

free(temp_node);

}

/* Function to Search an item from the list*/

DUBLL Search(int item,int flag)

{

temp_node = high;

if(high==NULL)

{

printf("\n List is not available. Please create a list first.");

getch();

CreateItem();

}

while(temp_node!=NULL)

{

if(temp_node->data==item )

{

if(flag==0)

{

return(1);

}

else

{

return(temp_node);

}

}

temp_node=temp_node->rightlink;

}

}

/* Function to Allocate nodes*/

DUBLL NodeAlloc()

{

DUBLL tmep_node;

tmep_node=malloc(sizeof(struct dubll));

if(tmep_node==NULL)

{

printf("\n No memory available. Node allocation cannot be done.");

}

tmep_node->rightlink=tmep_node->leftlink=NULL;

return(tmep_node);

}

/* Function to Insert items in the middle of the list*/

void InsertItem()

{

int node;

DUBLL temp_node;

if(high==NULL)

{

printf("\n List is not available. Please create a list first.");

getch();

CreateItem();

}

temp_node=NodeAlloc();

printf("Position At which node to be inserted: ___ & New Item Value: ___ ");

scanf("%d",&node);

scanf("%d",&temp_node->data);

pntr=Search(node,1);

if(pntr->rightlink==NULL){printf("\n The operation is not possible."); getch();return;}

temp_node->leftlink=pntr; //creating link to new node

temp_node->rightlink=pntr->rightlink;

pntr->rightlink->leftlink=temp_node;

pntr->rightlink=temp_node;

printf("\n Item has been Inserted.");

getch();

}

Answer 3

#include<stdio.h>

#include<conio.h>

#include<malloc.h>

#include<process.h>

struct node

{

int num;

struct node *next;

struct node *prev;

}; /* declaring a global node of type struct */

typedef struct node NODE; /* providing a type definition to the above created structure */

NODE *head=NULL; /* declaring some of the global variable that would be used throughout the program */

NODE *temp, *first, last;

int info;

void display();

void insert_at_end();

void insert_at_begin();

void insert_at_specifiedpos();

void main() /* starting the main method() */

{

int i;

clrscr();

printf("\nprogram for insertion in a doubly linked list :\n");

do

{

printf("\nEnter your choice :\n");

printf("\n1.Insert element at the end of the linkedlist :");

printf("\n2.Insert element at the begin of the linkedlist :");

printf("\n3.Insert at any specified position in the linkedlist :");

printf("\n4.Exit\n");

fflush(stdin);

scanf("\n%d",&i);

switch(i)

{

case 1:

insert_at_end();

display();

break;

case 2:

insert_at_begin();

display();

break;

case 3:

insert_at_specifiedpos();

display();

break;

case 4:

exit(0);

}

}while(i<=4);

getch();

}

void insert_at_end()

{

printf("\nEnter your element in the linked list :");

scanf("%d",&info);

temp=(NODE *)malloc(sizeof(NODE)); /* allocating memory for the node to be inserted */

temp->num=info;

temp->next=NULL;

temp->prev=NULL;

if(head==NULL) /* checking whether list is empty */

{

head=temp;

first=temp;

last=temp;

}

else

{

first=head;

while(first->next!=NULL)

{

first=first->next;

}

first->next=temp;

temp->prev=first;

temp->next=NULL;

last=temp;

}

}

void display()

{

first=head;

printf("\nStatus of the doubly linked list is as follows :\n");

while(first->next!=NULL) /* traversing the linked list */

{

printf("\n%d",first->num);

first=first->next;

}

}

void insert_at_begin()

{

printf("\nEnter the value which do you want to insert at begining\n");

scanf("\n%d",&info);

temp=(NODE *)malloc(sizeof(NODE));

temp->num=info;

temp->next=NULL;

temp->prev=NULL;

if(head==NULL)

{

head=temp;

last=temp;

}

else

{

temp->next=head;

head->prev=temp;

temp->prev=NULL;

head=temp;

}

}

void insert_at_specifiedpos()

{

NODE *second;

int node_num,info;

int i=1;

printf("\nEnter the nodenumber after which you want to insert new node\n");

scanf("%d",&node_num);

printf("\nEnter the value of new node\n");

scanf("\n%d",&info);

temp=(NODE *)malloc(sizeof(NODE));

temp->num=info;

temp->next=NULL;

temp->prev=NULL;

first=head;

while(i<node_num)

{

second=first;

first=first->next;

}

temp->next=first;

temp->prev=second;

first->prev=temp;

second->next=temp;

}

Answer 4

#include

#include

#include

int pop(int[], int&);

int push(int[], int&, int);

void display(int[], int);

const int size=20;

void main()

{

int stack[size], item, top=-1, res;

char ch='y';

clrscr();

while(ch=='y' ch=='Y')

{ cout<<"Enter Item for insertion: ";

cin>>item;

res=push(stack, top, item);

if (res==-1)

{ cout<<"\nOver flow\n ";

exit(1);

}

cout<<"\nThe stack now is:\n";

display(stack, top);

cout <<"\n Insert more Y N : ";

cin >> ch;

}

cout << "\n\n------------------"

<< "\nDeletion of element begins... \n";

ch='y';

while (ch=='y'ch=='Y')

{

res=pop(stack, top);

if(res==-1)

{ cout<< "Under flow";

exit(1);

}

else

{ cout<<"\nElement deleted is : "<

cout<<"\n\nThe stack now is :";

display(stack, top);

}

cout<<"\nWant to delete more element ";

cin >> ch;

}

}

int push(int stack[],int& top, int ele)

{ if (top==size-1)

return -1;

else

{ top ++;

stack[top]=ele;

}

return 0;

}

int pop (int stack[], int &top)

{ int ret;

if(top==-1)

return -1;

else

{ ret = stack[top];

top--;

}

return ret;

}

void display(int stack[], int top)

{ if (top == -1) return;

for(int i = top; i>=0; i--)

cout<<<endl;

cout<<"\n-----------------------\n\n\n";

}

Answer 5

#include<stdio.h>

#include<conio.h>

void main()

{

int top,i,max,a[50],value=23;

clrscr();

printf("value of top");

scanf("%d",&top);

printf("max size of stack");

scanf("%d",&max);

printf("enter the element in stack");

for(i=0;i<top;i++)

scanf("%d",&a[i]);

if(top==max-1)

{

printf("stack is full");

}

else

{

top=top+1;

a[top]=value;

}

printf("\n element of stack after insertion");

for(i=0;i<=top;i++)

{

printf("\n%d",a[i]);

}

getch();

}

Answer 6

node *SLSortWiseInsert(node *START, int data)

{

node *newnode;

if(START NULL))

{

printf("Inside this condition\n");

newnode = (node *)malloc(sizeof(node));

newnode->data = data;

newnode->link = NULL;

START->link = newnode;

return START;

}

START->link = SLSortWiseInsert(START->link,data);

return START;

}

Answer 7

#include<iostream.h>

class sll

{

private:

int data;

sll *next;

public:

sll* insert_one(int,sll*);

sll* delete_one(int,sll*);

void ftraverse(sll*);

void rtraverse(sll*);

void search(int,sll*);

void function();

};

void sll::function()

{

cout<<"******************************************\n";

cout<<"program to implement a singly linked list \n";

cout<<"******************************************\n";

sll * head;

head=NULL;

cout<<"\n\nMENU :\n";

cout<<"1)insertion\n"

<<"2)deletion\n"

<<"3)forward traversal\n"

<<"4)reverse traversal\n"

<<"5)search\n"

<<"6)exit\n\n";

cout<<"Enter your option :";

int opt;

cin>>opt;

int d;

while(opt!=6)

{

switch(opt)

{

case 1:

cout<<"Enter data to the node :";

cin>>d;

head=insert_one(d,head);

cout<<"inserted\n";

break;

case 2:

cout<<"Enter the data to be deleted :";

cin>>d;

head=delete_one(d,head);

break;

case 3:

cout<<"The forward traversal is :\n";

ftraverse(head);

break;

case 4:

cout<<"The reverse traversal is :\n";

rtraverse(head);

cout<<"NULL\n";

break;

case 5:

cout<<"Enter the element to be searched :";

int d;

cin>>d;

search(d,head);

break;

case 6:

break;

}

cout<<"\n\nMENU :\n";

cout<<"1)insertion\n"

<<"2)deletion\n"

<<"3)forward traversal\n"

<<"4)reverse traversal\n"

<<"5)search\n"

<<"6)exit\n\n";

cout<<"Enter your option :";

cin>>opt;

}

}

sll* sll::insert_one(int d,sll* s)

{

sll*NEW;

NEW=new sll;

NEW->data=d;

NEW->next=NULL;

if(s==NULL)

s=NEW;

else

{

sll*s1=s;

while(s1->next!=NULL)

s1=s1->next;

s1->next=NEW;

}

return s;

}

sll* sll::delete_one(int d,sll* s)

{

if(s==NULL)

{

cout<<"list empty \n";

return NULL;

}

if(s->data==d)

s=s->next;

else

{

sll *s1=s;

while( s1->next && s1->next->data!=d )

{

if(s1->next->data==d)

{

cout<<"deleted";

s1->next=s1->next->next;

return s;

}

s1=s1->next;

}

cout<<"not found";

}

return s;

}

void sll::ftraverse(sll* s)

{

sll * s1=s;

while(s1!=NULL)

{

cout<<s1->data<<" -> ";

s1=s1->next;

}

cout<<"NULL\n";

}

void sll::rtraverse(sll* s)

{

if(s==NULL)

return;

else

rtraverse(s->next);

cout<<s->data<<"->";

}

void sll::search(int d,sll* s)

{

while(s!=NULL)

{

if(s->data==d)

{

cout<<"found\n";

return ;

}

s=s->next;

}

cout<<" search unsuccess ful \n";

}

void main()

{

sll list;

list.function();

}

Answer 8

Deleting a given node

if( node.next ) node.next.prev = node.prev;

if( node.prev ) node.prev.next = node.next;

if( head node ) tail = node.prev;

delete( node );

Inserting at the head

if( head ) head.prev = node;

node.next = head;

head = node;

Inserting at the tail

if( tail ) tail.next = node;

node.prev = tail;

tail = node;

Inserting after a given node

node.prev = given;

node.next = given.next;

if( given.next) given.next.prev = node;

given.next = node;

Inserting before a given node

node.next = given;

node.prev = given.prev;

if( given.prev ) given.prev.next = node;

given.prev = node;