How to Implement Iterator for a Doubly Linked List in C++? Last Updated : 08 Jul, 2024 Comments Improve Suggest changes Like Article Like Report In C++, iterators are used to access elements of a container sequentially without exposing the underlying representation. When working with data structures like a doubly linked list, implementing an iterator can greatly enhance the usability and efficiency of the list as it allows users to traverse it easily. In this article, we will learn how to implement an iterator for a doubly linked list in C++.Implementation of Iterator for a Doubly Linked ListTo implement an iterator for a Doubly Linked List in C++, we can create a separate DoublyLinkedListIterator class that operates in conjunction with the DoublyLinkedList class. This iterator class allows us to traverse the list, dereference to access data, increment to move to the next node, decrement to move to the previous node, and compare for equality or inequality to check if two iterators are the same or different. By defining begin() and end() functions in the DoublyLinkedList class, we can obtain iterators pointing to the first element and one past the last element, respectively. Approach:First, define the node structure to represent each node in the doubly linked list.Create the doubly linked list class that implements methods to add and remove nodes from the list.Then, define the iterator class that provide operators for dereferencing, incrementing, and comparing iterators.Finally, integrate the iterator with the list to ensure that the doubly linked list class can return iterators pointing to the beginning and end of the list.C++ Program to Implement Iterator for a Doubly Linked ListThe below example demonstrates how we can implement an iterator for a doubly linked list in C++. C++ // C++ program to implement iterator for doubly linked list #include <iostream> using namespace std; // Node structure for doubly linked list struct Node { int data; Node* prev; Node* next; // Constructor to initialize node with a value Node(int value) : data(value) , prev(nullptr) , next(nullptr) { } }; // Iterator class for doubly linked list class DoublyLinkedListIterator { private: Node* current; // Current node pointer public: // Constructor to initialize iterator with a node DoublyLinkedListIterator(Node* node) : current(node) { } // Dereference operator to return reference to data int& operator*() { return current->data; } // Prefix increment operator to move to next node DoublyLinkedListIterator& operator++() { current = current->next; return *this; } // Prefix decrement operator to move to previous node DoublyLinkedListIterator& operator--() { current = current->prev; return *this; } // Inequality operator to compare iterators bool operator!=(const DoublyLinkedListIterator& other) const { return current != other.current; } // Equality operator to compare iterators bool operator==(const DoublyLinkedListIterator& other) const { return current == other.current; } }; // Doubly linked list class class DoublyLinkedList { private: // Pointer to head of the list Node* head; // Pointer to tail of the list Node* tail; public: // Constructor to initialize an empty list DoublyLinkedList() : head(nullptr) , tail(nullptr) { } // Function to append a new node with given value to the // list void append(int value) { // Create a new node Node* newNode = new Node(value); // If list is empty, set head and tail // to new node if (!head) { head = tail = newNode; } // Otherwise, append node to the end of the // list else { tail->next = newNode; newNode->prev = tail; tail = newNode; } } // Function to return iterator to the beginning of the // list DoublyLinkedListIterator begin() { return DoublyLinkedListIterator(head); } // Function to return iterator to the end of the list // (nullptr) DoublyLinkedListIterator end() { return DoublyLinkedListIterator(nullptr); } }; int main() { // Create a doubly linked list DoublyLinkedList list; // Append elements to the list list.append(10); list.append(20); list.append(30); // Iterate through the list using iterators and print // elements for (DoublyLinkedListIterator it = list.begin(); it != list.end(); ++it) { cout << *it << " "; } cout << endl; return 0; } Output10 20 30 Time Complexity: O(n), where n is the number of elements in the list. Auxilary Space: O(1) Comment More infoAdvertise with us Next Article How to Implement Iterator for a Doubly Linked List in C++? G gauravggeeksforgeeks Follow Improve Article Tags : C++ Programs C++ cpp-iterator CPP Examples Practice Tags : CPP Similar Reads C++ Programming Language C++ is a computer programming language developed by Bjarne Stroustrup as an extension of the C language. It is known for is fast speed, low level memory management and is often taught as first programming language. It provides:Hands-on application of different programming concepts.Similar syntax to 5 min read Non-linear Components In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co 11 min read Object Oriented Programming in C++ Object Oriented Programming - As the name suggests uses objects in programming. Object-oriented programming aims to implement real-world entities like inheritance, hiding, polymorphism, etc. in programming. The main aim of OOP is to bind together the data and the functions that operate on them so th 5 min read Spring Boot Tutorial Spring Boot is a Java framework that makes it easier to create and run Java applications. It simplifies the configuration and setup process, allowing developers to focus more on writing code for their applications. This Spring Boot Tutorial is a comprehensive guide that covers both basic and advance 10 min read Class Diagram | Unified Modeling Language (UML) A UML class diagram is a visual tool that represents the structure of a system by showing its classes, attributes, methods, and the relationships between them. It helps everyone involved in a projectâlike developers and designersâunderstand how the system is organized and how its components interact 12 min read Steady State Response In this article, we are going to discuss the steady-state response. We will see what is steady state response in Time domain analysis. We will then discuss some of the standard test signals used in finding the response of a response. We also discuss the first-order response for different signals. We 9 min read Backpropagation in Neural Network Back Propagation is also known as "Backward Propagation of Errors" is a method used to train neural network . Its goal is to reduce the difference between the modelâs predicted output and the actual output by adjusting the weights and biases in the network.It works iteratively to adjust weights and 9 min read Inheritance in C++ The capability of a class to derive properties and characteristics from another class is called Inheritance. Inheritance is one of the most important features of Object-Oriented Programming in C++. In this article, we will learn about inheritance in C++, its modes and types along with the informatio 10 min read Polymorphism in Java Polymorphism in Java is one of the core concepts in object-oriented programming (OOP) that allows objects to behave differently based on their specific class type. The word polymorphism means having many forms, and it comes from the Greek words poly (many) and morph (forms), this means one entity ca 7 min read 3-Phase Inverter An inverter is a fundamental electrical device designed primarily for the conversion of direct current into alternating current . This versatile device , also known as a variable frequency drive , plays a vital role in a wide range of applications , including variable frequency drives and high power 13 min read Like