n0vice17/datastructures-and-algorithm

This Repository covers all the topics of dsa which will help you to learn dsa in a better way

datastructures-and-algorithm's Issues

Let's implement some tests :)

Hey, everybody

I was thinking it would be great if we can add some tests to validate our models, in addition to a CI/CD pipeline that helps to ensure future modifications won't break anything.

I'm not sure how to implement this in all the different languages here. Should we create a tests folder and replicate the root structure inside? Should we add tests to each root folder with a special extension as .spec or .test? Each test suit should run by its own or we should create a make file to run all of them at once?

Can i add the Resursion codes in python [kindly check the pull request i added]]

Hi my self sreeram i'm currently in my 100daysofcode challenge
https://www.linkedin.com/in/sai-sree-ram-chavali-575788257/
I can contribute to this repository by adding all the data i'm sharing over linkedin and in github (my own)

Hacktoberfest

Steps to follow for Contributing:

Contributions are always welcome. Feel free to contribute as much as you want. Read the Contribution Guidelines here.

Binary Tree Folder and Code Missing

There is need of Binary Tree separate folder and related Code

Can we improve C implementation of linked list?

I have some ideas to improve the C implementation of linked list.

1. Create a type LinkedList with a head and a tail. This will improve the performance of insert operation, since we'll don't need to traverse the list anymore.

typedef struct
{
 Node *head;
 Node *tail;
} LinkedList;

2. In the insert method, there's no need to receive a pointer to pointer as the head node

void insert(int value, Node *head)
{
    Node    *node;
    node->data = value;
    node->next = NULL;

    while (head->next)
        head = head->next;

    if (!head)
        head = node;
    else
        head->next = node;
}

3. Linked Lists should support search, insert at and delete at operations.

4. We should create a destroy method to free all nodes of a list.