tasks

Author: GamilaCoding

0x17-doubly_linked_lists/3-add_dnodeint_end.c

@@ -0,0 +1,40 @@
+#include "lists.h"
+
+/**
+  * add_dnodeint_end - add a node at the end of a double linked list
+  * @head: header of double linked list
+  * @n: number to set in a new node
+  * Return: address of a new element
+  */
+dlistint_t *add_dnodeint_end(dlistint_t **head, const int n)
+{
+	dlistint_t *new, *headcopy;
+
+	headcopy = *head;
+
+	if (head == NULL)
+		return (NULL);
+
+	new = malloc(sizeof(dlistint_t));
+	if (new == NULL)
+		return (NULL);
+
+	new->n = n;
+
+	if (*head == NULL)
+	{
+		new->next = NULL;
+		new->prev = NULL;
+		*head = new;
+	}
+	else
+	{
+		while (headcopy->next != NULL)
+			headcopy = headcopy->next;
+		new->next = NULL;
+		new->prev = headcopy;
+		headcopy->next = new;
+	}
+
+	return (new);
+}

0x17-doubly_linked_lists/4-free_dlistint.c

@@ -0,0 +1,24 @@
+#include "lists.h"
+
+/**
+  * free_dlistint - free a double linked list
+  * @head: header of double linked list
+  * Return: nothing
+  */
+void free_dlistint(dlistint_t *head)
+{
+	dlistint_t *savepoin;
+
+	if (head != NULL)
+	{
+		while (head->prev != NULL)
+			head = head->prev;
+
+		while (head != NULL)
+		{
+			savepoin = head->next;
+			free(head);
+			head = savepoin;
+		}
+	}
+}