2171787
Beschreibung
Mindmap von Madeline Harlow, aktualisiert more than 1 year ago
|
Erstellt von Madeline Harlow
vor etwa 9 Jahre
|
|
Linked Lists WedW15
- Composed of nodes
- Nodes contain data
- Nodes contain
pointer to nxt
node
- typedef struct node{
int data; struct
node * next;}NODE;
- Saved in the heap
- NODE* p = malloc(sizeof(NODE));
- free(p);
- assert(p!=NULL);
- NODE* p = malloc(sizeof(NODE));
- Nodes contain data
- add nodes
- add to front
- newNode->next= head;
head = newNode;
- newNode->next= head;
head = newNode;
- add to back
- add to middle
- add to front
- delete nodes
- delete front
- delete middle
- delete last
- delete all
- delete front
- traverse a list
- modify/set values
- append (see add node)
- counting nodes (length)
- search for value
- sum, average, math
- # of occurances
- modify/set values
- Always
starts with
head
- head == NULL
the list is empty
- head != NULL
list is occupied
- head == NULL
the list is empty
- Always end with NULL
- if(p->next == NULL)
p is point to the last
node (p is tail)
- found the end of the list (see append)
- found the end of the list (see append)
- if(p == NULL)
- traverse through whole list
- traverse through whole list
- if(p->next == NULL)
p is point to the last
node (p is tail)
Möchten Sie kostenlos Ihre eigenen Mindmaps mit GoConqr erstellen? Mehr erfahren.