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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// Declare/define a struct type called 'struct _Node' -OR- 'Node' (two names).
typedef struct _Node {
int value;
struct _Node* next;
} Node;
int main(int argc, char* argv[]) {
// Linked list of size 1
Node* head = malloc(sizeof *head);
// Use this way to initialize any struct on the heap.
*head = (Node) { .value = 5, .next = NULL }; // Use this way!
// Boring way to initialize fields -- works but DO NOT USE IN THIS (↓) CLASS
//head -> value = 5;
//head -> next = NULL;
Node* tail = head;
// TODO: free list
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2024 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.