Skip to content

C implementations of essential data structures for efficient programming solutions.

Notifications You must be signed in to change notification settings

qossayrida/DataStructuresImplementationInC

Repository files navigation

Data Structures Implementation In C

This repository contains implementations of fundamental data structures in the C programming language. It is designed to help understand and utilize common data structures for various programming tasks and algorithms. Each data structure is implemented with accompanying comments and examples to demonstrate its usage.

Implemented Data Structures

  • Linked Lists
    • Singly Linked List
    • Cursor Linked List
  • Stacks
    • Array Implementation
    • Array In Struct Implementation
    • Linked List Implementation
  • Queues
    • Array Implementation
    • Linked List Implementation
  • Trees
    • Binary Search Tree
    • AVL Tree
    • Splay Tree
  • Heaps
    • Min Heap
    • Max Heap

Getting Started

To compile and run the examples:

  1. Clone the repository:

    git clone https://github.com/qossayrida/DataStructuresImplementationInC.git
    cd DataStructuresImplementationInC
  2. Compile the C file:

    gcc SplayTree.c -o SplayTree
  3. Run the compiled program:

    ./SplayTree

Contributing

Contributions are welcome! Please fork the repository, create a branch for your feature or bug fix, and submit a pull request for review.

About

C implementations of essential data structures for efficient programming solutions.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages