Some_DataStructure__in__C/a2ef4.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
/*             ASKISI 2h
*             FYLLADIO 4
*    STYLIANOS KARAKOSTAS it12146
*/


#include <stdio.h>
#include <stdlib.h>

typedef int ListElementType;
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);
void inverse_list(ListPointer *List);


int main()
{
    ListPointer AList,PredPtr;
    ListElementType Item;
    ListElementType AnItem;

    CreateList(&AList);
    PredPtr=NULL;
    int n, i;

    printf("The capacity of list: ");
    scanf("%d",&n);

    CreateList(&AList);

    for(i=0;i<n;i++)
    {
        printf("Give me number: ");
        scanf("%d",&Item);
        LinkedInsert(&AList, Item, PredPtr);
    }

    LinkedTraverse(AList);
    inverse_list(&AList);
    LinkedTraverse(AList);


system("Pause");
return 0;

}


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));
    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;
         while ( CurrPtr!=NULL )
        {
             printf("%d\n",(*CurrPtr).Data);
             CurrPtr = CurrPtr->Next;
        }
    }
}


void inverse_list(ListPointer *List)
{
    ListPointer Helplist,CurrPtr;
    CreateList(&Helplist);
    if(!EmptyList(*List))
    {
        CurrPtr=*List;
        while(CurrPtr!=NULL)
        {
            LinkedInsert(&Helplist, CurrPtr->Data, NULL);
            CurrPtr=CurrPtr->Next;
        }
        *List=Helplist;
    }
}