Linked-List/LIST_create_copy.c at master · saurabhs92/Linked-List · GitHub

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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<stdio.h>

typedef struct node
{
        int data;
        struct node *next;
}mynode;

void add(mynode **head, mynode **tail, int value);
void print_list(mynode *head);
void create_copy(mynode *p, mynode **q);

int main()
{
    mynode *head, *tail, *head2, *tail2;
    head = (mynode *)0;
    head2 = (mynode *)0;

    add(&head, &tail, 6);
    add(&head, &tail, 9);
    add(&head, &tail, 7);
    add(&head, &tail, 5);
    //add(&head, &tail, 1);
    add(&head, &tail, 3);
    //add(&head, &tail, 2);
    add(&head, &tail, 4);


    print_list(head);

    create_copy(head, &head2);

    print_list(head2);

    getch();
    return 0;
}


void add(mynode **head, mynode **tail, int value)
{
     mynode *temp = (mynode *)malloc(sizeof(struct node));
     temp -> data = value;
     temp -> next = (mynode *)0;

     if(*head == (mynode *)0)
              *head = temp;
     else

              (*tail) -> next = temp;

     *tail = temp;


}

void print_list(mynode *head)
{
     mynode *temp;
     printf("\n\n");
     for(temp = head; temp != (mynode *)0; temp = temp -> next)
              printf("%d  ->  ", temp -> data);
     printf("[NULL]\n");

}

void create_copy(mynode *p, mynode **q)
{
     if(p != (mynode *)0)
     {
          *q = malloc(sizeof(mynode)); // no need to cast
          (*q) -> data = p -> data;
          (*q) -> next = p -> next;
          create_copy(p -> next, &((*q) -> next));

     }

}