-
Notifications
You must be signed in to change notification settings - Fork 0
/
SiLinkList_Head.h
139 lines (120 loc) · 4.38 KB
/
SiLinkList_Head.h
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
//
// Created by Maylon on 2022/7/21.
// Name: single linked list with a head node
//
#include "LinkList.h"
#ifndef DATA_STRUCTURES_SILINKLIST_HEAD_H
#define DATA_STRUCTURES_SILINKLIST_HEAD_H
typedef struct SiLNode_Head {
ElemType data;
struct SiLNode_Head *next;
} SiLNode_Head, *SiList_Head;
/* Create */
/*!
* Initialize or reset the single linked list (with a head node)
* @param L : pointer to the single linked list pointer
* @return status (true, false)
*/
Status InitSiList_Head(SiList_Head *L);
/* Destroy */
/*!
* Destroy the single linked list (with a head node)
* @param L : pointer to the single linked list pointer
* @return status (true, false)
*/
Status DestroySiList_Head(SiList_Head *L);
/* Insert */
/*!
* Insert a node from head of the single linked list (with a head node)
* @param L : pointer to the single linked list
* @param e : element to be inserted
* @return status (true, false)
*/
Status SiList_Head_Head_Insert(SiList_Head L, ElemType e);
/*!
* Insert a node from tail of the single linked list (with a head node)
* @param L : pointer to the single linked list
* @param e : element to be insert
* @return status (true, false)
*/
Status SiList_Head_Tail_Insert(SiList_Head L, ElemType e);
/*!
* Insert a node before a specific node of the single linked list (with a head node) by order
* @param L : pointer to the single linked list
* @param i : the order of a specific node, legitimate range: [1, n + 1]
* @param e : element to be insert
* @return status (true, false, input_error)
*/
Status SiList_Head_Insert_By_Order(SiList_Head L, int i, ElemType e);
/* Delete */
/*!
* Delete a node of the single linked list (with a head node) by value
* @param L : pointer to the single linked list
* @param e : the data of the node to be deleted
* @return status (true, false)
*/
Status SiList_Head_Delete_By_Value(SiList_Head L, ElemType e);
/*!
* Delete a node of the single linked list (with a head node) by order
* @param L : pointer to the single linked list
* @param i : the order of a specific node, legitimate range: [1, n]
* @param e : the data of the node to be deleted
* @return status (true, false, input_error)
*/
Status SiList_Head_Delete_By_Order(SiList_Head L, int i, ElemType *e);
/* Retrieve */
/*!
* Retrieve a node of the single linked list (with a head node) by value
* @param L : pointer to the single linked list
* @param e : the data of the node to be retrieved
* @return pointer to the result node if successfully retrieved else NULL
*/
SiLNode_Head *SiList_Head_Retrieve_By_Value(SiList_Head L, ElemType e);
/*!
* Retrieve a node of the single linked list (with a head node) by order (only used in update and delete function)
* @param L : pointer to the single linked list
* @param i : the order of a specific node, legitimate range: [1, n]
* @return pointer to the result node if successfully retrieved else NULL or head node
*/
SiLNode_Head *SiList_Head_Retrieve_By_Order(SiList_Head L, int i);
/* Update */
/*!
* Update a node of the single linked list (with a head node) by value
* @param L : pointer to the single linked list
* @param old : the old data of the node to be updated
* @param new : the new data of the node to be updated
* @return status (true, false)
*/
Status SiList_Head_Update_By_Value(SiList_Head L, ElemType old, ElemType new);
/*!
* Update a node of the single linked list (with a head node) by order
* @param L : pointer to the single linked list
* @param i : the order of a specific node, legitimate range: [1, n]
* @param e : the data of the node to be updated
* @return status (true, false, input_error)
*/
Status SiList_Head_Update_By_Order(SiList_Head L, int i, ElemType e);
/* Reverse */
/*!
* Reverse the single linked list (with a head node)
* @param L : pointer to the single linked list
* @return status (true, false)
*/
Status SiList_Head_Reverse(SiList_Head L);
/* Traverse */
/*!
* Traverse the single linked list (with a head node)
* @param L : pointer to a single linked list
* @param visit : function pointer to the function that prints the data of a node
* @return status (true, false)
*/
Status SiList_Head_Traverse(SiList_Head L, void(*visit)(ElemType e));
/*!
* The single linked list (with a head node) menu
*/
void silinklist_head_menu(void);
/*!
* The single linked list (with a head node) menu details
*/
void silinklist_head_menu_show_details(void);
#endif //DATA_STRUCTURES_SILINKLIST_HEAD_H