make up my codes and use recursion

Author: mecomonteshbtn

0x12-singly_linked_lists/1-list_len_recursion.c

@@ -0,0 +1,12 @@
+#include "lists.h"
+
+/**
+ * list_len_recursion - A function that gets the number of nodes of linked list
+ * @h: head of linked list
+ * Return: number of nodes as size_t
+ */
+size_t list_len_recursion(const list_t *h)
+{
+	if (h != NULL)
+		return (1 + list_len_recursion(h->next));
+}

0x12-singly_linked_lists/11-main.c

@@ -0,0 +1,34 @@
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+#include "lists.h"
+
+/**
+ * main - check the code for Holberton School students.
+ *
+ * Return: Always 0.
+ */
+int main(void)
+{
+  list_t *head;
+  list_t *new;
+  list_t hello = {"World", 5, NULL};
+  size_t n;
+
+  head = &hello;
+  new = malloc(sizeof(list_t));
+  if (new == NULL)
+    {
+      printf("Error\n");
+      return (1);
+    }
+  new->str = strdup("Hello");
+  new->len = 5;
+  new->next = head;
+  head = new;
+  n = list_len_recursion(head);
+  printf("-> %lu elements\n", n);
+  free(new->str);
+  free(new);
+  return (0);
+}

0x12-singly_linked_lists/2-add_node.c

@@ -10,16 +10,16 @@
 list_t *add_node(list_t **head, const char *str)
 {
 	list_t *temp;
-	int nodes = 0;
+	int length = 0;
 
 	temp = malloc(sizeof(list_t));
 	if (temp == NULL)
 		return (NULL);
 
-	while (str[nodes])
-		nodes++;
+	while (str[length])
+		length++;
 
-	temp->len = nodes;
+	temp->len = length;
 	temp->str = strdup(str);
 	temp->next = *head;
 	*head = temp;

0x12-singly_linked_lists/3-add_node_end.c

@@ -10,16 +10,16 @@
 list_t *add_node_end(list_t **head, const char *str)
 {
 	list_t *new_node, *temp;
-	unsigned int nodes = 0;
+	unsigned int length = 0;
 
 	new_node = malloc(sizeof(list_t));
 	if (new_node == NULL)
 		return (NULL);
 
-	while (str[nodes])
-		nodes++;
+	while (str[length])
+		length++;
 
-	new_node->len = nodes;
+	new_node->len = length;
 	new_node->str = strdup(str);
 	if (*head == NULL)
 	{

0x12-singly_linked_lists/lists.h

@@ -20,6 +20,7 @@ typedef struct list_s
 
 size_t print_list(const list_t *h);
 size_t list_len(const list_t *h);
+size_t list_len_recursion(const list_t *h);
 list_t *add_node(list_t **head, const char *str);
 list_t *add_node_end(list_t **head, const char *str);
 void free_list(list_t *head);