Sparse Array for C

Projects with applications of different data structures implemented with C following industry-standard practices.

PADS are generic C data structures that use the preprocessor for abstraction.

This contains my codes for PSUC, DSD, OOP, DS, DBS, ES, AL Labs.

Circular (Ring) byte buffer written in C

The Monty Hall Problem ported to the Nintendo DS!

BlocksDS example project

Work-in-progress decompilation project of Mario Kart DS: documentation, ASM-hacking and other tools

A DS homebrew tech demo where one can hop around some 3D platforms with some bouncing bunnies.

Repository containing codes for the DS Lab - III Sem CCE

pxtone music playback for Nintendo DS

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 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.

labs and assignments codes in data structure and object oriented programming course at NYCU.

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.