Review Data Structure UTS Linked List A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. These are the advantages of using linked list: - Dynamic size, so the size can change during run time - Ease of insertion and deletion - Efficient memory utilization, no need to pre-allocate memory - Faster access time - Linear data structures such as Stack, Queue can easily be implemented using Linked List These are the disadvantages of using linked list : - Use more memory because pointer requires extra memory for storage - No random access - Reverse traversing is difficult There are types of Linked List, which is : - Singly Linked List It is the most common. Each node has data and a pointer the next code - Doubly Linked List ...