how to traverse a linked list in c++
//make sure you have access to the first node in the list
for (Node *ptr = first; ptr != nullptr; ptr = ptr->next) {
cout << ptr->data << " ";
}
how to traverse a linked list in c++
//make sure you have access to the first node in the list
for (Node *ptr = first; ptr != nullptr; ptr = ptr->next) {
cout << ptr->data << " ";
}
linked list class c++ basic implementation
template<typename T>
class list {
public:
struct node {
T value;
node* next;
};
list() : hd(nullptr), tl(nullptr) {}
node* head() { return hd; }
node* tail() { return tl; }
void insert(node* prior, T value);
node* at(int i);
void erase(node* prior);
void clear();
void push_back(T value);
void pop_back();
void push_front(T value);
void pop_front();
int size();
private:
node* hd, tl;
}
Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us