shree1999/data-structures-and-algorithms

Hi 👋, I'm Shreeansh

A developer by profession

• 🔭 I’m currently working on my personal development project and other things

• 🌱 I’m currently learning about Typescript, Microservices related topics

• 👨‍💻 All of my projects are available at My repositories

• 💬 Ask me about react and javascript or it can be MERN stack

• 📫 How to reach me [email protected]

data-structures-and-algorithms's Issues

Error in Data-Structures-and-Algorithms/blob/master/Arrays-Implementation/arrays/main.cpp

In Data-Structures-and-Algorithms/blob/master/Arrays-Implementation/arrays/main.cpp, the get method, I think that we should test index < totalNumbers rather than index < capacity. Here is a reference: https://www.geeksforgeeks.org/how-to-implement-our-own-vector-class-in-c/.

Data Structures and Algorithms C/C++

Add methods to access Linked List elements

Implement a get() method to access the element at a certain index of the Linked List and a find() method to search for an element with a specific value and return its index.

[LOGIC] - BST REMOVE NODE

In the below code snippet from BST under the deleteNode function. The logic is quite unclear for me like how it is working for the below case.

            Root
           /    \
     child1   child2
     /   \      
 Null   leaf1

Code Snippet

else if (temp->left == NULL || temp->right == NULL)
                {
                    cout << "We are deleting parent node which have one child" << endl;
                    if (temp->left != NULL)
                    {
                        parent->left = temp->left;
                    }
                    else
                    {
                        parent->right = temp->right;
                    }
                    free(temp);
                    return;
                }

If you can put light on it then it would be a great help :)

Delete Function [BST]

cout << "Deleting Node which has two children" << endl;
// in this case we need to find the pre-order successor.
Node *t = temp->right;
if (t->left == NULL && t->right == NULL)
{
    temp->data = t->data;
    temp->right = NULL;
    free(t);
    return;
}
else if (t->left == NULL && t->right != NULL)
{
    temp->data = t->data;
    temp->right = t->right;
    free(t);
    return;
}
while (t->left != NULL)
{
    parent = t;
    t = t->left;
}
temp->data = t->data;
parent->left = NULL;
free(t);
return;

In the above code snippet of the Delete function from BST. Please mention cases that we are handling.