As I'm learning DSA, I decided to make a repo for people interested in how Abstract Data Types (ADT) work. I'll do my best to keep this repo updated
Tip
The explanation of every ADT and DSA will be added to WIKI soon
Important
Run Build.bat file to build the solution
The first and main reason you ought to know is these data structures and algorithms will help you to understand the underlying process of each type and Abstract Data Type (ADT).
For instance if you are a junior programmer or new to these languages like Java, C++ and C you might encounter not knowing what ADT you have to use in your application to keep the data efficiently.
The second reason is that by knowing this information you can nail the interview and get hired. some applications are time and space sensitive it means you need to optimize your code to make a process streamlined.
How can you do that? Well by knowing how everything works. that's why employers tend to ask DSA questions in an interview.
Note
I'll update this section whenever I add a new Data Structure or Abstract Data Type.
| Data Structure | Abstract Data Type |
|---|---|
| Dynamic Array | Vector |
| String | String |
| Linked List | List |
| Linked List | Stack |
| Linked List | Queue |
| Node | Doubly Node |
| Node | Singly Node |
| Binary Tree | Binary Search Tree (BST) |