LISTE!!! #include #include using namespace std; typedef int elemType; typedef struct Node { elemType elem; Node *next; }; Node* prepend(Node *first, Node *pNew) { if (pNew != NULL) pNew -> next = first; return (pNew); } Node* find_in_list(elemType x, Node *first) { Node *p = first; while (p != NULL && p -> elem != x) p = p -> next; return p; } void print_list(Node *l) { while(l != NULL) { cout << l -> elem << endl; l = l -> next; } } Node* append(Node *first, Node *pNew) { Node *last = first; if (first == NULL) { first = pNew; pNew -> next = NULL; } else { while (last -> next != NULL) last = last -> next; last -> next = pNew; pNew -> next = NULL; } return first; } Node* node_insert_after(Node *here, Node *pNew) { if (here == NULL) pNew -> next = NULL; else { pNew -> next = here -> next; here -> next = pNew; } return (pNew); } int main() { Node *First = new Node; First = NULL; Node *pNew = new Node; pNew -> elem = 9; First = prepend(First, pNew); pNew = new Node; pNew -> elem = 7; First = prepend(First, pNew); pNew = new Node; pNew -> elem = 5; First = prepend(First, pNew); pNew = new Node; pNew -> elem = 3; First = prepend(First, pNew); pNew = new Node; pNew -> elem = 1; First = prepend(First, pNew); if (First != NULL) print_list(First); cout<<" --- Od nekog odredjenog broja --- "< elem = 6; First = append (First, pNew); print_list(First); cout<<" --- U sredini liste se dodaje neki broj --- "< elem = 6; Node *here = find_in_list(5, First); pNew = node_insert_after (here, pNew); print_list (First); system ("pause"); return 0; }