Linked List

Linked List

Circular single linked list:
Node terakhir mengandung pointer ke node awal
Double linked list:
Two way Linked list data struct dengan 2 hubungan.1 menunjuk tentang data berikutnya.yang lainnya menunjuk data sebelumnya
Cth: if (head) = null;{
        node -> value = x
        node -> next = null;
        node -> prev = null;
        head = node;
        tail = node;
        }

        else{
        node -> value = x;
        node -> next = null;
        node ->prev = tall;
        tail -> next = node;
        tail = node;
        }

        //Free in Node 
          while(head){
          head = head -> next;
          free ( head -> prev);
          head -> prev = null;