Double Linked list


#include <malloc.h>

#include <iostream>

using namespace std;

int main() {

    int i;

    struct SimpanData {

        int angka;

        struct SimpanData *next;

        struct SimpanData *before;

    } start , *node;

    start.next=NULL;

    start.before=NULL;

    node = &start;

    for(int i=0; i<10; i++) {

              //alokasi memori=malloc

node -> next = (struct SimpanData *)//casting bentuk struct pointer untuk mengalokasikan besarnya struct SimpanData

                       malloc(sizeof(struct SimpanData));

          node->next->before=node;

          //geser

        node = node -> next;

        node -> angka = i;

        node -> next = NULL;

    }

    node = start.next;

    while(node->next) {

        cout << node -> angka << endl;

        node = node -> next;

    }

    while(node->before) {

        cout << node-> angka <<endl;

        node = node -> before;

    }

    return 0;

}

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s