mirror of
https://github.com/ada-dmitry/prog.l_ada.git
synced 2026-09-24 09:10:14 +00:00
28 lines
709 B
C
28 lines
709 B
C
#define N 10
|
|
|
|
|
|
typedef struct Node {
|
|
long int data;
|
|
struct Node *next;
|
|
struct Node *prev;
|
|
char s[N];
|
|
} node;
|
|
typedef struct nodepointer {
|
|
struct nodepointer *next;
|
|
struct Node **address;
|
|
} pointer;
|
|
|
|
void pr(node *tmp);
|
|
node *add_head(node *head, int hh);
|
|
node *del_head(node *head);
|
|
pointer *add_head_address(pointer *head, node **address);
|
|
int length(node *list);
|
|
node *sort(node *head);
|
|
node *get(node *list, int n);
|
|
void swap(node *a, node *b);
|
|
node *adv_add_head(node *head, int hh, char string[]);
|
|
void hanoi_tower(int n, node **head_from, node **head_to, node **head_aux, pointer* adresses);
|
|
void printftof(pointer* adresses);
|
|
node *end(node *head);
|
|
node* printextra(node *head, int len, int i);
|