C_DS_AIgo/linked_list.h

32 lines
396 B
C
Raw Normal View History

2025-03-17 16:27:15 +08:00
#ifndef LINKED_LIST_H
#define LINKED_LIST_H
typedef struct node
{
int value;
struct node* next;
} node;
// <20><>ʼ<EFBFBD><CABC><EFBFBD>ڵ<EFBFBD>
node* init_node(int val);
// ɾ<><C9BE><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ڵ<EFBFBD>
void delete_node(node* n);
// <20><EFBFBD>ڵ<EFBFBD>
void replace_node (node* n, int val);
// <20><><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD>
void insert_node(node** head, int val);
//<2F><><EFBFBD>ʽڵ<CABD>
int get_node(node* n);
// <20><><EFBFBD><EFBFBD>
int find_node(node* head, int val);
#endif