Summary
Hello guys, so today we'll be doing a quick summary of Linked List, Hashing, and Binary Tree :D Linked List If I were to associate it with things, I'll say linked list is sort of like a ton of numbered & locked box, where each box contains an item and a key to the next box. Formally speaking, Linked list is basically a collection, or a structure containing records of data, where each record contain the address or reference to the record next to it (sequencially). As I suggested before, there's Single Linked List and Double Linked List, right? In following I'll include some basic function from the infamous Double Linked List. #include<stdlib.h> -> Jangan lupa struct data{ int value; struct data *prev, *next; }*head, *tail, *curr; void boom(){ head->prev=tail; tail->next=head; } void pushHead(int a){ curr=(struct data*)malloc(sizeof(struct data)); curr->value=a; if (head==NULL){ head=tail=curr; } else{ curr-...