Tugas

SUMMARY Linked-list single Linked List is a data structure consisting of nodes. which together form a sequence. In its most basic form, each node contains data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. More complex variants add additional links, allowing more efficient insertion or removal of nodes at arbitrary positions. A drawback of linked lists is that access time is linear (and difficult to the pipeline). Faster access, such as random access, is not feasible. Arrays have better cache locality compared to linked lists. Stack: In the pushdown stacks only two operations are allowed: push the item into the stack, and pop the item out of the stack. A stack is a limited access data structure - elements can be added and removed from the stack only at the top. push adds an item to the top of the stack, pop removes the item from the

Single linked list Double Linked List The double linked list is a data structure in computer science where a linked data structure that contains a set of continuously linked records known as nodes. each of these known nodes contains 3 fields, a single data field, and 2 address fields. a double linked list has a major difference from its predecessor which is a single linked list in which a single linked list connects each node in one way from the start until its end, while the double linked list has each node connected to both its previous and next nodes which makes two-way movement in between them. a node of a double linked list.   a node of a single linked list. the linked list address fields contain the address of its previous node and next node generally, each end of a double linked list contains a terminator that generally consists of a null value. double linked list allow node traversal in both directions. Circular Linked List Simply put,