How mateusfkschenato/praticas-ed works
This repository is a set of five independent C data-structure lab demos, not one integrated application. Each lab’s main program initializes or populates a structure, exercises operations, and prints results. The distinct stages are a contiguous product list, singly linked list, doubly linked list, queue operations, and binary-search-tree operations. The tree additionally implements search, insertion/removal, traversal, counting, height, and pruning. Edges show only calls visible in the sampled mains; the queue demo also uses a stack, but its implementation is absent from the supplied tree, so that subsystem is not mapped.
Main entry points: Laboratório 1/main.c List Demo · Laboratório 2/main.c List Demo · Laboratório 3/main.c List Demo · Laboratório 4/main.c Queue Demo
Components 11
Contiguous List
- List Demo
Laboratório 1/main.c - Product List
Laboratório 1/TADListaContEst.c - Allocation Demo
Laboratório 1/malloc.c
Singly Linked List
- List Demo
Laboratório 2/main.c - Linked List
Laboratório 2/listaEnc.c
Doubly Linked List
- List Demo
Laboratório 3/main.c - Doubly Linked List
Laboratório 3/listaDuplaEnc.c
Queue Exercise
- Queue Demo
Laboratório 4/main.c - Linked Queue
Laboratório 4/filaEnc.c
Search Tree
- Tree Demo
Laboratório 5/main.c - Binary Search Tree
Laboratório 5/abp.c
Connections 5
- List Demo → Product List: filters and prints
Laboratório 1/main.c - List Demo → Linked List: calls list operations
Laboratório 2/main.c - List Demo → Doubly Linked List: calls list operations
Laboratório 3/main.c - Queue Demo → Linked Queue: calls queue operations
Laboratório 4/main.c - Tree Demo → Binary Search Tree: calls tree operations
Laboratório 5/main.c