-
Notifications
You must be signed in to change notification settings - Fork 0
/
doublyLinkedList.cpp
59 lines (53 loc) · 1.1 KB
/
doublyLinkedList.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<bits/stdc++.h>
using namespace std;
struct node{
int data;
node* next;
node* prev;
};
node* head;
node* getNewNode(int data ){
node* newNode=new node();
newNode->data=data;
newNode->next=NULL;
newNode->prev=NULL;
return newNode;
}
void insert1(int x){
node* newNode=getNewNode(x);
if(head==NULL){
head=newNode;
return;
}
head->prev=newNode;
newNode->next=head;
head=newNode;
}
void print1(){
node* temp=head;
cout<<"Forward : ";
while(temp!=NULL){
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
void reversePrint(){
node* temp=head;
if(temp==NULL)return;
else{
// go to the last node so that we can start using the prev pointer
while(temp->next!=NULL){temp=temp->next;}
cout<<"Reverse : ";
while(temp!=NULL){cout<<temp->data<<" ";
temp=temp->prev;}
cout<<endl;
}
}
int main(){
head=NULL;
insert1(2);print1();reversePrint();
insert1(4);print1();reversePrint();
insert1(6);print1();reversePrint();
return 0;
}