Some_DataStructure__in__C/a2bf4.c at main · Small-hawk/Some_DataStructure__in__C · 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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <conio.h>

#define Null 0

typedef int ListElementType;           /* ï ôýðïò ôùí óôïé÷åßùí ôçò óõíäåäåìÝíçò ëßóôáò
                                        åíäåéêôéêÜ ôýðïõ int */
typedef struct ListNode *ListPointer;   //ï ôýðïò ôùí äåéêôþí ãéá ôïõò êüìâïõò
typedef struct ListNode
{
	ListElementType Data;
    ListPointer Next;
} ListNode;

typedef enum {
    FALSE, TRUE
} boolean;


void CreateList(ListPointer *List);
boolean EmptyList(ListPointer List);
void LinkedInsert(ListPointer *List, ListElementType Item, ListPointer PredPtr);
void LinkedDelete(ListPointer *List, ListPointer PredPtr);
void LinkedTraverse(ListPointer List);


CopyLists(ListPointer List, ListPointer *FinalList);


main()
{
   ListPointer PredPtr, CurrPtr1;
    ListElementType AItem ;
    ListPointer AList,FinalList;
    int numberNodes, i;

    CreateList(&AList);
    CreateList(&FinalList);

    printf("Dwse to plh8os to komvwn: ");
    scanf("%d",&numberNodes);

    for(i=0;i<numberNodes;i++)
    {
        printf("Dwse to stoixeio gia eisagwgh(%do komvo): ",i+1);
        scanf("%d", &AItem);
        LinkedInsert(&AList,AItem,Null);
    }
    printf("\n**arxikh lista**\n");
    LinkedTraverse(AList);


    printf("\n**telikh lista**\n");
    CopyLists(AList,&FinalList);

    LinkedTraverse(FinalList);


    system("pause");
}


CopyLists(ListPointer List, ListPointer *FinalList){

    ListPointer CurrPtr1, CurrPtr2;
    ListPointer TempPtr;

    CreateList(&TempPtr);

    CurrPtr1=List;

    while( CurrPtr1!=Null){
        LinkedInsert(&TempPtr,(*CurrPtr1).Data,Null);

        CurrPtr1= (*CurrPtr1).Next;
    }

    while(TempPtr!=Null){
        LinkedInsert(&(*FinalList),(*TempPtr).Data,Null);

        TempPtr= (*TempPtr).Next;

    }
}

void CreateList(ListPointer *List)
{
	*List = NULL;
}

boolean EmptyList(ListPointer List)
{
	return (List==NULL);
}

void LinkedInsert(ListPointer *List, ListElementType Item, ListPointer PredPtr)
{
	ListPointer TempPtr;

   TempPtr= (ListPointer)malloc(sizeof(struct ListNode));
   //printf("Insert &List %7d, List %7d,  &(*List) %7d, (*List) %7d, TempPtr %7d\n",
   //&List, List,  &(*List), (*List), TempPtr);
   TempPtr->Data = Item;
	if (PredPtr==NULL) {
        TempPtr->Next = *List;
        *List = TempPtr;
    }
    else {
        TempPtr->Next = PredPtr->Next;
        PredPtr->Next = TempPtr;
    }
}

void LinkedDelete(ListPointer *List, ListPointer PredPtr)
{
    ListPointer TempPtr;

    if (EmptyList(*List))
   	    printf("EMPTY LIST\n");
   else
   {
   	    if (PredPtr == NULL)
        {
      	      TempPtr = *List;
              *List = TempPtr->Next;
        }
        else
        {
      	     TempPtr = PredPtr->Next;
             PredPtr->Next = TempPtr->Next;
        }
        free(TempPtr);
    }
}

void LinkedTraverse(ListPointer List)
{
	ListPointer CurrPtr;

   if (EmptyList(List))
   	    printf("EMPTY LIST\n");
   else
   {
   	    CurrPtr = List;
   	     //printf("\n");

         while ( CurrPtr!=NULL )
        {

             printf(" %d",(*CurrPtr).Data);
             CurrPtr = CurrPtr->Next;
        }
   }
   printf("\n");
}