-
Notifications
You must be signed in to change notification settings - Fork 0
/
ft_lstadd_back.c
33 lines (28 loc) · 1.31 KB
/
ft_lstadd_back.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_lstadd_back.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: amait-ou <amait-ou@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/09/29 14:55:25 by amait-ou #+# #+# */
/* Updated: 2023/06/27 18:15:44 by amait-ou ### ########.fr */
/* */
/* ************************************************************************** */
/*
"ft_lstadd_back" adds a node at the end of the linked list
that's why we have to achieve the last node which its next is "NULL" and then
add the new node to its next.
if the linked list is empty then the node that we are attempting to add
would be the first one.
*/
#include "libft.h"
void ft_lstadd_back(t_list **lst, t_list *new)
{
t_list *lastnode;
lastnode = ft_lstlast(*lst);
if (*lst)
lastnode->next = new;
else
*lst = new;
}