4 articles to explore
Explore the Graph data structures in C. Learn key terminology, understand different representations like Adjacency Matrices and Adjacency Lists, and master fundamental traversal algorithms: Depth-First Search (DFS) and Breadth-First Search (BFS).
Read articleNon-linear data structures with Trees in C. Learn essential terminology, explore Binary Trees and Binary Search Trees (BSTs), master traversal algorithms (DFS, BFS), and implement core BST operations like insertion, search, and deletion.
Read articleLearn how to implement fundamental Abstract Data Types (ADTs) - Stacks (LIFO) and Queues (FIFO) - in C using both arrays and linked lists. Understand their operations, applications, and trade-offs.
Read articleExplore the fundamental data structure: the Linked List in C. Learn how to create, insert, delete, traverse, and search nodes using pointers and dynamic memory allocation. Understand the advantages over arrays.
Read article