How to have your own Node structure in a forward_list in C++?

Question

How do I combine my own typical typedef Node { int data; int data1; Node* next} to make a forward_list ? I think I can throw away the Node* next (i.e. typedef Node { int data, int data1} ) and make the STL manage the pointers through forward_list, but then how do I delete a pointer to a particular Node ? The standard iterator on forward_list is a long int and not a Node ; so if I use my Node to create a linkedlist, how do I delete a Node from that list ?

Answer 1

I think I can throw away the Node* next and make the STL manage the pointers

Yes this is what you should do

how do I delete a pointer to a particular Node ?

std::forward_list::remove
std::forward_list::erase_after
std::forward_list::remove_if
std::forward_list::pop_front
std::remove
std::remove_if

give different algorithms to delete nodes from the list

how do I delete a Node from that list ?

Follow the example in this link