DS/doubly_linked_list.cpp at master · ashok2811/DS · GitHub

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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <bits/stdc++.h>
using namespace std;

struct Node
{
	int data;
	Node* next;
	Node* prev;

};

Node* head;

struct Node* GetNewNode(int x){
	Node* temp1 = new Node();
	temp1 -> data = x;
	temp1 -> next = NULL;
	temp1 -> prev = NULL;
	return temp1;
};

void InsertAtHead(int x){

	Node* newNode = GetNewNode(x);
	if (head==NULL){
		head =newNode;
		return;
	}

	head -> prev = newNode;
	newNode -> next =head;
	head =newNode;

}

void Print() {
	Node* temp = head;
	cout << ("Forward: ");
	while(temp != NULL){

		cout << temp -> data << " ";
		temp = temp -> next;
	}

	cout << endl;
}

void RevPrint() {
	Node* temp = head;
	if(temp == NULL) return;

	while(temp -> next != NULL){
		temp = temp -> next;
	}

	cout << ("Reverse: ");
	while(temp != NULL){

		cout << temp -> data<< " ";
		temp = temp -> prev;
	}

	cout << endl;
}


int main(int argc, char const *argv[])
{
	head = NULL;
	InsertAtHead (2); Print(); RevPrint();
	InsertAtHead (3); Print(); RevPrint();
	InsertAtHead (4); Print(); RevPrint();

	return 0;
}