Merging two doubly-linked-lists into another - Data Structures Source Code in C++

Special : Web Developer's Collection CD-ROM
50,000+ Web Templates, Logos, Cliparts, Scripts. Order Now!

Add to Favorites Make Home Page

1043 Online

Language Categories

Source Codes Home
Project Ideas New!
Interview Questions
FAQs Home
ASP Home: ASP Source Codes; ASP Script Directory New!; ASP .Net Script Directory New!; ASP Interview Questions; ASP FAQs; ASP How Tos
C Home: C Source Codes; C Script Directory New!; C Interview Questions; C FAQs; C How Tos
C++ Home: C++ Source Codes; C++ Script Directory New!; C++ Interview Questions; C++ FAQs; C++ How Tos
Java Home: Java Source Codes; Java Directory New!; Java Interview Questions; Java FAQs; Java How Tos
JavaScript Home: JavaScript Directory New!; JavaScript Source Codes; JavaScript FAQs; JavaScript How Tos
COBOL Home: COBOL Source Codes; COBOL FAQs; COBOL How Tos
Pascal Home: Pascal Source Codes; Pascal FAQs; Pascal How Tos
PHP Script Directory New!
Python Script Directory New!
Perl & CGI Script Directory New!
Flash Script Directory New!
CFML Script Directory New!
Remotely Hosted Scripts New!
Tools & Utilities Directory New!
XML Script Directory New!
Best Programmers: Amit Mathur; Vishal Bhardwaj; Deepesh Jain
Vyom NetWork

Our Services

Get 9,000 Interview Questions & Answers in an eBook.

9500+ Pages
9000 Question & Answers
All Tech. Categories

14 MB Content

Get it now !!

Home » C++ Home » Data Structures Home » Merging two doubly-linked-lists into another

A D V E R T I S E M E N T

Title	Merging two doubly-linked-lists into another
Author	Mokopela Tsepe
Author Email	eliatsepemokopela [at] yahoo.com
Description	This program will take two doubly-linked lists of nodes and merges them into another doubly-linked list of nodes.
Category	C++ » Data Structures
Hits	396833
Code	Select and Copy the Code
Code : #include<iostream> using namespace std; class Node { public: int data; Node next; Node prev; Node() { data=0; next=prev=NULL; } }; class Node1 { public: int data; Node1 next; Node1 prev; Node1() { data=0; next=prev=NULL; } }; class Node2 { public: int data; Node2 next; Node2 prev; Node2() { data=0; next=prev=NULL; } }; class DoublyLinkedList { private: Node headNode, tailnode; Node1 headNode1, tailNode1; Node2 headNode2, tailNode2; public: DoublyLinkedList() { headNode=tailNode=NULL; headNode1=tailNode1=NULL; headNode2=tailNode2=NULL; } void Insert();//Insert data into the two lists void Merge() ;//Merging two lists into one void Display();//Display only the merged list }; void DoublyLinkedList::Insert() { char option; //This section inserts elements into the nodes of the first list do { Node newnode = new Node(); cin>>newnode->data; newnode->next=NULL; newnode->prev=NULL; if(headNode==NULL) { headNode= tailNode=newnode; } else { Node curr = headNode; while(curr->next!=NULL) { curr=curr->next; } curr->next=tailNode=newnode; newnode->prev=curr; } cout<<"Enter y to continue adding data into the first list :"; cin>>option; } while(option=='y'\|\|option=='Y'); //The section inserts the elements into the nodes of the second list do { Node1 newnode = new Node1(); cin>>newnode->data; newnode->next=NULL; newnode->prev=NULL; if(headNode1==NULL) { headNode1=tailNode1=newnode; } else { Node1 curr = headNode1; while(curr->next!=NULL) { curr=curr->next; } curr->next= tailNode1=newnode; newnode->prev=curr; } cout<<"Enter y to continue adding data into the second list :"; cin>>option; } while(option=='y'\|\|option=='Y'); } void DoublyLinkedList::Merge() { Node currentNode=headNode; Node1 currentNode1=headNode1; //This section of code copies all the data from list 1 into the new list while(currentNode!=NULL) { Node2 newnode = new Node2(); newnode->data = currentNode->data; newnode->next = NULL; newnode->prev = NULL; if(headNode2==NULL) { headNode2=tailNode2=newnode; } else { Node2 temp = headNode2; while(temp->next!=NULL) { temp=temp->next; } temp->next=tailNode2=newnode; newnode->prev=temp; } currentNode=currentNode->next; } //This section of code appends the new list with data from the second list while(currentNode1!=NULL) { Node2 newnode = new Node2(); newnode->data = currentNode1->data; newnode->next = newnode->prev=NULL; if(tailNode2->next==NULL) { tailNode2->next=newnode; newnode->prev = tailNode2; tailNode2=newnode; } currentNode1= currentNode1->next; } } void DoublyLinkedList::Display() { Node2 currentNode2 = headNode2; while(currentNode2!=NULL) { cout<<currentNode2->data<<" "; currentNode2=currentNode2->next; } cout<<endl; } void main() { DoublyLinkedList DLL; DLL.Insert(); DLL.Merge(); DLL.Display(); }

Related Source Codes

Script Name Author

Moving ball screen saver karlmarx

The Classic Game of Snake & Ladder Lakshmi Narayana .A

Railway seat reservation question which comes in sapient VyomWorld

To calculate percentile Ravi Mathur

Send to folder ANIMESH SAHU

Analog clock and calendar Nazia & Rida

HIGH/LOW GAME MOLLY ARORA

Data structure (stack Implimentation) Swapnil B Adsure

Memory Game AnirudhSanyal

Easy Calc Anirudh Sanyal

GK Quiz Anirudh Sanyal

Hangman Game Manish Jain

Snakeman Manish Jain

Full month Calendar Nigi

Cursor shapes nigi

A D V E R T I S E M E N T

Google Groups Subscribe to SourceCodesWorld - Techies Talk

Email:

Free eBook - Interview Questions: Get over 1,000 Interview Questions in an eBook for free when you join JobsAssist. Just click on the button below to join JobsAssist and you will immediately receive the Free eBook with thousands of Interview Questions in an ebook when you join.

Free Tutorials - HTML, Java, SQL, PHP, ASP, Perl, SQL Tutorials
Discuss Programming Problems and Freshers Jobs related issues here.
Discuss Final Year Project Ideas here.

Advertisements

L I N K S

Jobs & Career: Freshers Jobs; Jobs Newsletter; Placement Papers; Placement Papers
GATE Preparation: Analysis & Design Of Algo.; Operating System; Lexical Analysis
GRE Preparation: GRE Home; 1208 Antonyms Test; 5000 Word's List; Top 100 Words' List; Scholarships; Top 100 CS Univ.; Top 126 EE Univ.
Tutorials: Hardware Tutorial; 1500 Free eBooks; XML Tutorial
Webmaster Resources: EzTraffic; Articles
Fun: Send FREE SMS!; SMS Jokes; Love SMS; Funny Jokes

Google Search

Source Codes World.com is a part of Vyom Network.

Sitemap | Privacy Policy | Terms and Conditions | Important Websites
Copyright ©2003-2024 SourceCodesWorld.com, All Rights Reserved.
Page URL: http://www.sourcecodesworld.com/source/show.asp?ScriptID=1212