added Theory (Complexity Analysis and Data Structures) #13
Conversation
|
👋 @Ghruank |
There was a problem hiding this comment.
Hi @Ghruank, That's a great contribution and I want to let you know that you're the first person to make contribution on theory part. Not to mention, you did a great job in following the mentioned instructions and guidelines.
But, we believe there's be some misunderstanding for a few section and we request you to make the following changes for your PR to get merged.
There was a problem hiding this comment.
Please create a Table of content as described on Instructions and Guidelines.
There was a problem hiding this comment.
Please make any ONE of the following changes,
-
Create
README.mdfile within theTheory/Data-Structuredirectory/folder. -
Place all the sub-directories/folder within
Theory/Data-StructureintoTheorydirectory.For example,
Theory/Data-Structures/Graphs/README.mdshould becomeTheory/Graphs/README.md
Note
But I strongly suggest you to go with second option for now, The automations will work properly when you place all directories/folders without any complex hierarchies like have sub-folders under sub-folders.
Important
Please make sure you make sure the same is being reflected with all the files & directories/folder present within Data-Structure directory/folder which includes,
Theory/Data-Structures/Graphs/README.mdTheory/Data-Structures/Linked-Lists/README.mdTheory/Data-Structures/Queues/README.mdTheory/Data-Structures/Stacks/README.mdTheory/Data-Structures/Trees/README.md
Tip
Please read the CONTRIBUTING.md file at the file structure section.
| - **Complexity Analysis** | ||
| - [Complexity Analysis](./Complexity-Analysis/README.md) | ||
|
|
||
| - **Data Structures** | ||
| - [Stacks](./Data-Structures/Stacks/README.md) | ||
| - [Queues](./Data-Structures/Queues/README.md) | ||
| - [Linked Lists](./Data-Structures/Linked-Lists/README.md) | ||
| - [Trees](./Data-Structures/Trees/README.md) | ||
| - [Graphs](./Data-Structures/Graphs/README.md) |
There was a problem hiding this comment.
Please remove manually entered content, these details will be updated manually.
| - **Complexity Analysis** | |
| - [Complexity Analysis](./Complexity-Analysis/README.md) | |
| - **Data Structures** | |
| - [Stacks](./Data-Structures/Stacks/README.md) | |
| - [Queues](./Data-Structures/Queues/README.md) | |
| - [Linked Lists](./Data-Structures/Linked-Lists/README.md) | |
| - [Trees](./Data-Structures/Trees/README.md) | |
| - [Graphs](./Data-Structures/Graphs/README.md) |
| <!-- TABLE OF CONTENT ENDS --> | ||
|
|
||
| ## Table of Contribution | ||
|
|
||
| <!-- TABLE OF CONTRIBUTORS BEGINS --> | ||
| | Contribution Title | Contributor Names | Pull Requests | Demo | | ||
| | --- | --- | --- | --- | | ||
| | - | - | - | - | | ||
| | Complexity Analysis and Data Structures| ghruank | #13 | - | |
There was a problem hiding this comment.
Please remove manually entered content, these details will be updated manually.
| | Complexity Analysis and Data Structures| ghruank | #13 | - | |
| - **Complexity Analysis** | ||
| - [Complexity Analysis](./Complexity-Analysis/README.md) | ||
|
|
||
| - **Data Structures** | ||
| - [Stacks](./Data-Structures/Stacks/README.md) | ||
| - [Queues](./Data-Structures/Queues/README.md) | ||
| - [Linked Lists](./Data-Structures/Linked-Lists/README.md) | ||
| - [Trees](./Data-Structures/Trees/README.md) | ||
| - [Graphs](./Data-Structures/Graphs/README.md) |
There was a problem hiding this comment.
Please remove manually entered content, these details will be updated manually.
| - **Complexity Analysis** | |
| - [Complexity Analysis](./Complexity-Analysis/README.md) | |
| - **Data Structures** | |
| - [Stacks](./Data-Structures/Stacks/README.md) | |
| - [Queues](./Data-Structures/Queues/README.md) | |
| - [Linked Lists](./Data-Structures/Linked-Lists/README.md) | |
| - [Trees](./Data-Structures/Trees/README.md) | |
| - [Graphs](./Data-Structures/Graphs/README.md) |
| @@ -0,0 +1,29 @@ | |||
| ## 5. Graphs | |||
| A **Graph** is a collection of vertices (nodes) and edges (connections between nodes) representing networks. | |||
|
|
|||
There was a problem hiding this comment.
Please create a Table of content as described on Instructions and Guidelines.
| @@ -0,0 +1,29 @@ | |||
| ## 3. Linked Lists | |||
| A **Linked List** is a linear data structure consisting of nodes, where each node contains a data part and a reference (or link) to the next node in the sequence. | |||
|
|
|||
There was a problem hiding this comment.
Please create a Table of content as described on Instructions and Guidelines.
| @@ -0,0 +1,27 @@ | |||
| ## 2. Queues | |||
| A **Queue** is a linear data structure that follows the First-In-First-Out (FIFO) principle. The first element added is the first to be removed. | |||
|
|
|||
There was a problem hiding this comment.
Please create a Table of content as described on Instructions and Guidelines.
| @@ -0,0 +1,21 @@ | |||
| ## 1. Stacks | |||
| A **Stack** is a linear data structure that follows the Last-In-First-Out (LIFO) principle. This means the last element added is the first one to be removed. | |||
|
|
|||
There was a problem hiding this comment.
Please create a Table of content as described on Instructions and Guidelines.
| @@ -0,0 +1,37 @@ | |||
| ## 4. Trees | |||
| A **Tree** is a hierarchical data structure consisting of nodes with a parent-child relationship. It starts with a **root** node and expands into subtrees of children, representing various hierarchical levels. | |||
|
|
|||
There was a problem hiding this comment.
Please create a Table of content as described on Instructions and Guidelines.
|
This PR is stale because it has been open 45 days with no activity. Remove stale label or comment or this will be closed in 10 days. |
|
This PR was closed because it has been stalled for 10 days with no activity. |
added some theory on complexity analysis and data structures. Maintained the naming conventions and file structures as mentioned in the README. Updated the index and added links to the theory topics.