https://github.com/tim0-12432/data-structures

https://github.com/tim0-12432/data-structures

data-structures datastructures datastructures-algorithms

Last synced: 4 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/tim0-12432/data-structures
• Owner: tim0-12432
• License: mit
• Created: 2022-06-20T21:43:20.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2022-08-09T18:59:25.000Z (almost 3 years ago)
• Last Synced: 2025-01-16T22:22:49.472Z (5 months ago)
• Topics: data-structures, datastructures, datastructures-algorithms
• Language: C#
• Homepage:
• Size: 170 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

        
# Datastructures

[![Tests](https://github.com/tim0-12432/data-structures/actions/workflows/dotnet.yml/badge.svg)](https://github.com/tim0-12432/data-structures/actions/workflows/dotnet.yml)

Originated through my preparation for the exams in modules `Object-Oriented Programming` and `Algorithms and Datastructures`. 



## Single linked list :heavy_check_mark:

![single linked list](./doc/images/single-linked-list.png)

| Reference  | Note                              |

|------------|-----------------------------------|

| Successor  | the following element in the list |

## Double linked list :heavy_check_mark:

![double linked list](./doc/images/double-linked-list.png)

| Reference   | Note                                           |

|-------------|------------------------------------------------|

| Successor   | the following element in the list              |

| Predecessor | the element in the list before the current one |

### Circular double linked list :heavy_check_mark:

## Stack :heavy_check_mark:

![stack](./doc/images/stack.png)

## Queue :heavy_check_mark:

![queue](./doc/images/queue.png)

## Hashtable :heavy_check_mark:

![hashtable](./doc/images/hashtable.png)

## Binary Tree :heavy_check_mark:

![binary tree](./doc/images/binary-tree.png)

| Reference  | Note                           |

|------------|--------------------------------|

| Parent     | the parent element in the tree |

| LeftChild  | the element following left     |

| RightChild | the element following right    |

## Red-Black-Tree :heavy_check_mark:

![red black tree (black height=2)](./doc/images/rb-tree.png)

## Heap :heavy_check_mark:

![max heap](./doc/images/max-heap.png)

## B-Tree :x:

![b tree (k=2)](./doc/images/b-tree.png)

## Fibonacci-Heap :heavy_check_mark:

![fibonacci heap](./doc/images/fib-heap.png)

| Reference/Attribute | Note                           |

|---------------------|--------------------------------|

| Parent              | the parent element in the tree |

| LeftNeighbour       | the element following left     |

| RightNeighbour      | the element following right    |

| Child               | the children in a list         |

| Degree              | amount of children             |

| Mark                | flag set when lost a child     |

| Key                 | priority of the node           |