Easy to use, modular, header only, macro based, generic and type-safe Data Structures in C

My final project in Data Structures class

C Standard Data Structures: C++-like collection of header-only single file libraries of the most popular and useful data structures implemented using macros.

An employee management system project is a software application that helps an organization manage and monitor the information and activities of its employees.

A hash array-mapped trie implementation in C

All my solutions for CS50X - 2023

上海理工大学数据结构课程设计项目：课程信息管理系统

上海理工大学数据结构课程设计：校园导航系统的设计实现

Para acompanhamento do livro Estruturas de Dados: Domine as práticas essenciais em C, Java, C#, Python e JavaScript

Data Structures Laboratory Program

This is a simple implementation of the knapsack problem in C in both recursive and dynamic programming approaches.

This is a simple implementation of Binary Search Tree (BST) in C language. All In-order, Pre-order, and Post-order traversal functions are implemented.

A C program to swap the left and right nodes of a binary tree. It mean we are going to change the left node to right and right node to left. Even the child nodes of the left and right nodes will be swapped. This program is written in C language.

A C program to deep copy a binary tree. Deep copy means that any changes made to the new binary tree don't affect the original binary tree. Both recursive and iterative algorithms are implemented. The iterative algorithm a few lines of code and uses a variable to keep track of the current node.

This is a C implementation of the Binary-Trees Equality program to check two binary trees are identical or not.

This is a simple contacts manager written in C with a simple CLI interface and a lot of features.

This is a simple C program to check if a binary tree is full or not.

This is a simple implementation of a circular linked-list in C. Circular linked-lists are a type of linked-list where the last node points to the first node. This is useful for implementing queues and stacks. This implementation is a doubly linked-list, meaning that each node has a pointer to the next node and a pointer to the previous node.

This is a simple implementation of a doubly linked-list in C. Doubly linked-lists are a type of data structure that are similar to singly linked-lists, but they have a pointer to the previous node in addition to the next node. This allows for traversal in both directions.

This is a simple implementation of a singly linked-list in C. Singly linked-lists are a type of data structure that are used to store a collection of elements. Each element in a singly linked-list is called a node. Each node contains two parts: the data and a pointer to the next node. The first node in a singly linked-list is called the head.