Differences

This shows you the differences between two versions of the page.

--- notes:data:spring2024:projects:mpg2 [2024/02/29 04:36] – [singly-linked list] rspringe
+++ notes:data:spring2024:projects:mpg2 [2024/02/29 04:49] (current) – [singly-linked list] rspringe
@@ Line 12: / Line 12: @@
 Since a linked list is a series of "nodes", or structs that point to each other, then new elements can easily be added: as long as there is enough memory to be allocated to a new struct, the last struct in a linked list can be made to point to this new struct.
+The same also applies for removing elements. Once an element has been removed from a linked list, the memory can be freed so it can be used elsewhere, if needed.
 =====malloc=====
+Since this project deals with linked lists and dynamically adding and removing elements from a list, malloc will still need to be used to allocate memory.
+Generally, malloc will need to be used to add a new element to a linked list.
+The pseudocode will look like so:
+<code c>
+functionForAddingElement(args) {
+    struct* newStruct = (struct*)malloc(sizeof(struct));
+    // Place Data into New Struct
+    // Loop through Linked List to the End
+    // Place New Struct at End of List
+}
+</code>
+**Reference:** https://www.geeksforgeeks.org/insertion-in-linked-list/

Lab46 Wiki