Mengenal IT: Program Komplit Double Linked List Circular C++

Program Komplit Double Linked List Circular C++.
langsung kita simak ya codingnya kawan...
cekidott ^_^

/* Double Linked List Circular [DLLC]
 Imam Prasetyo - 2012140966 - 03TPLPC [3C]
 Teknik Informatika
 Universitas Pamulang */

#include<cstdlib>
#include<conio.h>
#include<stdlib.h>
#include<stdio.h>
#include<iostream>
using namespace std;

typedef struct TNode
{
 int data_imam;
 TNode *next_imam;
 TNode *prev_imam;
}TNode;
TNode *head_imam, *tail_imam;
int data_imam;

void init_imam();
int isEmpty_imam();
void insertDepan_imam(int databaru_imam);
void insertBelakang_imam(int databaru_imam);
void hapusDepan_imam();
void hapusBelakang_imam();
void clear_imam();
void tampil_imam();
void search_imam() ;
 
int main()
{
 system("cls");
 int key;
  printf("\n");
  printf(" ===================================\n");
  printf(" ||  DOUBLE LINK LIST CIRCULAR    ||\n");
  printf(" ===================================\n");
  printf("           MENU PILIHAN :           \n");
  printf(" ===================================\n");
  printf(" [1] Insert Depan\n");
  printf(" [2] Insert Belakang\n");
  printf(" [3] Hapus Depan \n");
  printf(" [4] Hapus Belakang\n");
  printf(" [5] Tampil / Cetak Data\n");
  printf(" [6] Pencarian Data\n");
  printf(" [7] Hapus Semua List\n");
  printf(" [8] Keluar Program\n");
  printf(" ===================================\n");
  printf(" ===================================\n");
  printf(" ->->Masukan Pilihan Anda < 1 - 7 > : ");
  scanf("%d",&key); 
  if(key==1)  
  {  
   printf(" Masukan data : "); scanf("%d",&data_imam);  
   insertDepan_imam(data_imam); 
   getch();main();
  }  
  else if(key==2)  
  {  
   printf(" Masukan data : "); scanf("%d",&data_imam);  
   insertBelakang_imam(data_imam); 
   getch();main();
  }  
  else if(key==3)  
  {  
   hapusDepan_imam();  
   getch();main(); 
  }  
  else if(key==4)  
  {  
   hapusBelakang_imam();
   getch();main();
  }
  else if(key==5)  
  { 
   tampil_imam();getch();main(); 
  }    
  else if(key==6)  
  {  
   search_imam() ;
   getch();main();
  } 
  else if(key==7)
  {  
   clear_imam();  
   printf(" Semua List Sudah Di Hapus \n");
   getch();main();
  }
  else if(key==8)
  {
   exit(1);
  }
  else  
  {  
   printf("\n Pilihan Anda Salah \n"); 
   getch();main(); 
  }   
}

void init_imam()
{
 head_imam = NULL;
 tail_imam = NULL;
}

int isEmpty_imam()
{
 if(tail_imam == NULL) return 1;
 else return 0;
}

void search_imam() 
{   
 TNode *bantu;
 printf(" Data yang telah anda masukkan :");tampil_imam();
 printf(" Masukan data yang anda ingin cari : "); 
 scanf("%d",&data_imam); 
    bantu=head_imam;
    while(bantu->next_imam!=head_imam)
    {
        if(bantu->data_imam==data_imam)
  {
            cout<<" Data "<<bantu->data_imam<<" Ditemukan "<<endl;
  }
  bantu=bantu->next_imam;
    } 
}

void insertDepan_imam (int data_imambaru)
{
 TNode *baru;
 baru = new TNode;
 baru->data_imam = data_imambaru;
 baru->next_imam = baru;
 baru->prev_imam = baru;
 if(isEmpty_imam()==1)
 {
  head_imam=baru;
  tail_imam=baru;
  head_imam->next_imam = head_imam;
  head_imam->prev_imam = head_imam;
  tail_imam->next_imam = tail_imam;
  tail_imam->prev_imam = tail_imam;
 }
 else 
 {
  baru->next_imam = head_imam;
  head_imam->prev_imam = baru;
  head_imam = baru;
  head_imam->prev_imam = tail_imam;
  tail_imam->next_imam = head_imam;
 }
 printf(" Data telah masuk...\n");
}

void insertBelakang_imam(int data_imambaru)
{
 TNode *baru;
 baru = new TNode;
 baru->data_imam = data_imambaru;
 baru->next_imam = baru;
 baru->prev_imam = baru;
 if(isEmpty_imam()==1)
 {
   head_imam=baru;
   tail_imam=baru;
   head_imam->next_imam = head_imam;
   head_imam->prev_imam = head_imam;
   tail_imam->next_imam = tail_imam;
   tail_imam->prev_imam = tail_imam;
 }
 else 
 {
   tail_imam->next_imam = baru;
   baru->prev_imam = tail_imam;
   tail_imam = baru;
   tail_imam->next_imam = head_imam;
   head_imam->prev_imam = tail_imam;
 }
 printf(" Data telah masuk...\n");
}

void hapusDepan_imam()
{
 TNode *hapus;
 int d;
 if (isEmpty_imam()==0)
 {
  if(head_imam != tail_imam)
  {
   hapus = head_imam;
   d = hapus->data_imam;
   head_imam = head_imam->next_imam;
   tail_imam->next_imam = head_imam;
   head_imam->prev_imam = tail_imam;
   delete hapus;
  } 
  else 
  {
   d = head_imam->data_imam;
   head_imam = NULL;
   tail_imam = NULL;
  }
  printf("%d Terhapus",d);
  }
  else 
  printf(" Masih kosong...\n");
}

void hapusBelakang_imam()
{
 TNode *hapus;
 int d;
 if (isEmpty_imam()==0)
 {
  if(head_imam != tail_imam)
  {
   hapus = tail_imam;
          d = hapus->data_imam;
   tail_imam = tail_imam->prev_imam;
   tail_imam->next_imam = head_imam;
   head_imam->prev_imam = tail_imam;
   delete hapus;
  }
  else 
  {
   d = head_imam->data_imam;
   head_imam = NULL;
   tail_imam = NULL;
  }
  printf(" Terhapus !\n");
 } 
 else 
 printf(" Masih kosong !\n");
}

void tampil_imam()
{
 TNode *bantu;
 bantu = head_imam;
 if(isEmpty_imam()==0)
 {
  do
  {
   printf(" [%d]",bantu->data_imam);
   bantu=bantu->next_imam;
  }
  while(bantu!=tail_imam->next_imam);
  printf("\n");
 } 
 else 
 printf(" Kosong !\n");
}

void clear_imam()
{
 TNode *bantu,*hapus;
 if (isEmpty_imam()==0)
 {
  bantu = head_imam;
  while(bantu->next_imam!=head_imam)
  {
   hapus = bantu;
   bantu = bantu->next_imam;
   delete hapus;
  }
  head_imam = NULL;
 } 
}

Link Download :

DLLC | http://adf.ly/cnKjl

Mengenal IT

Program Komplit Double Linked List Circular C++

0 komentar:

Posting Komentar

Archivo del blog

Mengenai Saya

Belajar C++