https://github.com/dipto1971/data_structures_and_algorithms
Data Structures & Algorithms
https://github.com/dipto1971/data_structures_and_algorithms
data-structures-and-algorithms dsaproject dynamic-programming graph greedy-algorithms hashtable heap linked-list queue recursion-algorithm shortest-path-algorithm sorting-algorithms stack tree
Last synced: 3 months ago
JSON representation
Data Structures & Algorithms
- Host: GitHub
- URL: https://github.com/dipto1971/data_structures_and_algorithms
- Owner: Dipto1971
- Created: 2023-06-14T17:06:44.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2025-01-25T16:57:12.000Z (4 months ago)
- Last Synced: 2025-01-25T17:31:54.811Z (4 months ago)
- Topics: data-structures-and-algorithms, dsaproject, dynamic-programming, graph, greedy-algorithms, hashtable, heap, linked-list, queue, recursion-algorithm, shortest-path-algorithm, sorting-algorithms, stack, tree
- Language: C++
- Homepage:
- Size: 30.8 MB
- Stars: 16
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: Readme.md
Awesome Lists containing this project
README
# Data Structures Repository
This repository contains implementations and explanations of various data structures concepts in programming.
## Table of Contents
1. [Introduction](#introduction)
2. [List of Data Structures](#list-of-data-structures)
1. [Array](#array)
2. [Linked List](#linked-list)
3. [Stack](#stack)
4. [Queue](#queue)
5. [Tree](#tree)
6. [Graph](#graph)
7. [Hash Table](#hash-table)
8. [Heap](#heap)
9. [Trie](#trie)
10. [Graph](#graph)## Introduction
Data structures are essential components in computer science and programming. They provide a way to organize and store data efficiently, enabling efficient algorithms and operations. This repository aims to cover various data structures, along with code implementations and explanations.
## List of Data Structures
### Array
An array is a collection of elements, each identified by an index or a key. It is a basic and widely used data structure.
### Linked List
A linked list is a linear collection of elements where each element points to the next one in the sequence.
### Stack
A stack is a collection of elements with two main principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element.
### Queue
A queue is a collection of elements that follows the First In, First Out (FIFO) principle.
### Tree
A tree is a hierarchical data structure with a root element and subtrees of children with a parent node, representing a hierarchy.
### Graph
A graph is a collection of nodes connected by edges, representing relationships between the nodes.
### Hash Table
A hash table is a data structure that implements an associative array abstract data type, a structure that can map keys to values.
### Heap
A heap is a specialized tree-based data structure that satisfies the heap property.
### Trie
A trie, also known as a digital tree or prefix tree, is an ordered tree data structure that is used to store a dynamic set or associative array.
### Graph
A graph is a collection of nodes connected by edges, representing relationships between the nodes.
## Usage
To use any of the data structures in this repository, follow the instructions provided in each directory.
## Contributing
If you'd like to contribute to this repository, please follow the [contribution guidelines](CONTRIBUTING.md).