https://github.com/liteobject/practice-data-structure
https://github.com/liteobject/practice-data-structure
Last synced: about 1 month ago
JSON representation
- Host: GitHub
- URL: https://github.com/liteobject/practice-data-structure
- Owner: LiteObject
- Created: 2022-09-11T16:12:00.000Z (over 3 years ago)
- Default Branch: master
- Last Pushed: 2022-09-11T16:12:03.000Z (over 3 years ago)
- Last Synced: 2024-12-29T18:22:40.888Z (about 1 year ago)
- Language: C#
- Size: 3.91 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
# Data Structures
Data Structures refer to how data is organized
## Operations
- Read
- Search
- Insert
- Delete
## Classification
- Linear: Elements are arranged sequentially
- Static
- Static DS has a fixed memory side
- It's easier to access the elements in a static DS
- Example: Array
- Dynamic
- In dynamic DS, the size is not fixed. It can be randomly modified during runtime, which may be considered memory inefficient
- Example: Queue, Stack, LinkedList
- Non-linear: Elements are not placed sequentially, side by side.
- Tree
- Graph
---
## Array
Array is one of the most basic data structures in CS.
## Linked List
A linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
## Stack
Stacks are a collection that adheres to the last in, first out (LIFO) concept.
## Queue
## Hash Table
## Heap
## Binary Tree
## Binary Search Tree
## Graph