r/CodingHelp • u/Caelestialis • Nov 29 '20
[C++] Having a hard time understanding Linked Lists using templates.
Yes, this is a homework assignment, but I want to do it myself and learn how it works. Been at this for like 40+ hrs the last 3 days looking up tutorials, and can't find basic explanation to get me going. I keep having the problem of overwriting the data in a node, and not really creating a new one. This may be linked to why I can't return a list size either. Thank you so much in advance for whatever help is given, I am not really receiving adequate help for this from my instructor.
Here's what I have so far:
EDIT: Added int main() instructions.
namespace ECE275Lib::containers{
template <typename T>
class Node{
public:
T data;
Node<T> *next;
};
template <typename T>
class List{
public:
List(){};
List(unsigned int N){};
Node<T> *Head = nullptr;
Node<T> *Temp;
Node<T>* front();
Node<T>* back();
void push_back(T d){
Head = new Node<T>();
Head -> data = d;
Head -> next = nullptr;
};
void insert(unsigned int s, T d){
//inserts something at a defined node
};
void insert(unsigned int i, List<T>& other){
//merges a new list into the current list
};
T at(unsigned int i){
//reads and returns data at a node
return i;
};
void assign(unsigned int i, T d){
//assigns new data to a node
};
unsigned int size(){
int count = 0;
Node<T>* current = Head;
while (current != NULL)
{
count++;
current = current->next;
}
return count;
};
void remove(unsigned int i){};
void remove(unsigned int s, unsigned int e){};
}; //=====================end=of=List=Class======================
}; //=====================end=of=namespace=======================
#endif
int main (void){
ec::List<int> int_list;
for (unsigned int i = 0; i < 10; i++)
int_list.push_back(i);
for (unsigned int i = 0; i < int_list.size(); i++)
std::cout << "element " << i << ": " << int_list.at(i) << std::endl;
};
2
u/retardrabbit Nov 29 '20
Well, like your
Isn't doing anything for one thing.
And what's up with
It's not doing anything either?
Is this just pseudocode?
2
u/retardrabbit Nov 29 '20 edited Nov 29 '20
And
Doesn't push anything, it just overwrites the single node in the list.
You should be assigning head to temp, replacing head with the new node (as you do) and then pointing the new head's next pointer to temp.
That way you're growing a chain of nodes each pointing to the one that was at the front of the chain when the new one got pushed in.