Bayu Techno

Implementasikan Operasi Dasar Pada Double Linked List: Menyisipkan Sebagai Simpul Ujung (Awal) Dari Linked List

#include <iostream>

using namespace std;

struct Node{

int val;

Node *next;

Node *prev;

};

//Tahap Inisiasi

Node *front, *rear, *cur, *del, *newNode, *afterNode;

int totalNode = 0;

void insert(int val);

int main()

{

int input;

cout << "Masukan Nilai : ";

cin>>input;

cout << "\n";

insert(input);

}

void create(int val){

front = new Node();

front->val = val;

//transversing

front->prev = NULL;

front->next = NULL;

rear = front;

totalNode++;

}

//Fungsi Inputan data user

void insert(int val){

if(totalNode == 0){

create(val);

cout << "Data Telah Dimasukan ";

return;

}

newNode = new Node();

newNode->val = val;

//trasversing

front->prev = newNode;

newNode->next = front;

newNode->prev = NULL;

front = newNode;

totalNode++;

}