Thread: Linked Lists Chapter 15 Practice Problem 1 Jumping Into C++

OK, I give up. I've been researching for three days straight how to use linked lists, but nothing is helping. Any chance on of you can help me with the problem? The decryption is this:

Write a program to remove an element from a linked list; the remove function should take just the element to be removed. Is this function easy to write--and will it be fast? Could this be made easier or faster by adding an additional pointer to the list?³⁵

___________________________
³⁵Hint: what if you had a pointer to the previous node? Does that help?

I do not know how linked lists work at all, really. That's the problem. Do you think maybe you could help? I can't find a resource that teaches it without assuming you know how classes work.

I know this site has strict homework policies but I'm going to give you the basic structure you need. Assuming a singly linked list, your data structure should look like this :

Code:

struct node {

   void *data;
   node *next;
};

OP, do you know about pointers? Do you know about allocating structures? Do you know how to create a class out of a structure?

Oh my apologies then.

Code:

template<class T>
struct node {

    T data;
    node<T> *next;
};

Originally Posted by laserlight

I suggest that you start with this: write a program to create, print and destroy a singly linked list of five elements.

Does anyone know of some simple linked list example programs that I can traverse with debugging so that I might be able to get some practice with the syntax? Because I can't do it on my own from scratch. I need some examples so that I can see it implemented. For instance, a program that creates, prints, and destroys a singly linked list of five elements?

I may start crying. The Prelude's linked lists tutorial's example problems are not working when I type them into a C command line tool in Xcode. Do you think, maybe, you could give me a short program that creates, prints, and destroys a singled linked list?

Lol the panic you feel means you are becoming a programmer

So, is this doing it right?

Code:

#include <iostream>usingnamespacestd;


struct EnemySpaceShip {
    int weaponPower;
    EnemySpaceShip* p_next_enemy;
};






EnemySpaceShip* addNewEnemyToList (EnemySpaceShip* p_list) {
EnemySpaceShip* p_ship = newEnemySpaceShip;
    p_ship->weaponPower = 20;
    p_ship->p_next_enemy = p_list;
    return p_ship;
}


int main () {
    EnemySpaceShip* p_enemies = NULL;
addNewEnemyToList(p_enemies);
    EnemySpaceShip* p_newEnemy = NULL;
    p_newEnemy = addNewEnemyToList(p_newEnemy);
    cout << p_newEnemy->weaponPower;
}

I think that this is supposed to set a head and initialize it to NULL, then add another ship to the list and print it's weaponPower.

Oh, wait. The above code makes two linked lists. This is better:

Code:

#include <iostream>usingnamespacestd;


struct EnemySpaceShip {
    int weaponPower;
    EnemySpaceShip* p_next_enemy;
};






EnemySpaceShip* addNewEnemyToList (EnemySpaceShip* p_list) {
EnemySpaceShip* p_ship = newEnemySpaceShip;
    p_ship->weaponPower = 20;
    p_ship->p_next_enemy = p_list;
    return p_ship;
}


int main () {
    EnemySpaceShip* p_enemies = NULL;
    p_enemies = addNewEnemyToList(p_enemies);
    cout << p_enemies->weaponPower << "\n";
}