《数据结构》-严蔚敏.吴伟民-教材源码与习题解析

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

A hash array-mapped trie implementation in C

data structure and algorithm

中国海洋大学数据结构课程

记录平时所学

All Data Structures Implementation in C and Python programming languages. All famous Algorithms implementation in C and Python language. Dynamic Programming Algorithms.

数据结构课堂作业+大作业+计组部分+MATLAB部分

严蔚敏吴伟民《数据结构》C 语言描述 案例习题详解（含代码）

Implementação da Red Black Tree (Árvore Rubro Negra) para números inteiros. Desenvolvido por Othon Briganó e Pedro Warmling Botelho

🍃 An assortment of useful C stuff

C版数据结构与算法分析

assignments and project at emertxe

My final project in Data Structures class

┬─┬ノ( º _ ºノ) – A simple implementation of the cuckoo hashing scheme

Object-oriented programming is a programming paradigm based on the concept of "objects", which can contain data and code: data in the form of fields, and code, in the form of procedures. A feature of objects is that an object's own procedures can access and often modify the data fields of itself.

This is a simple implementation of Circular Doubly Linked-List in C. Circular Doubly Linked-List is a data structure that is a combination of a doubly linked list and a circular linked list. It is a linked list where all nodes are connected to each other. It is a circular linked list because all nodes are connected to each other.

What You Think Is What You Get.

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

数据结构、算法、一些经典用法的学习示例代码（均由笔者编写并且调试通过）。