/Java/Implementing iterator for linked list java

Implementing iterator for linked list java

public class BasicLinkedList<T> implements Iterable<T> {
    public int size;

    private class Node {
        private T data;
        private Node next;

        private Node(T data) {
            this.data = data;
            next = null;
        }
    }

    private Node head;
    private Node tail;

    public BasicLinkedList() {
        head = tail = null;
    }
//Add, remove method 

public Iterator<T> iterator() {
        return new Iterator<T>() {

            Node current = head;

            @Override
            public boolean hasNext() {
                return current != null;
            }

            @Override
            public T next() {
                if(hasNext()){
                    T data = current.data;
                    current = current.next;
                    return data;
                }
                return null;
            }

            @Override
            public void remove(){
                throw new UnsupportedOperationException("Remove not implemented.");
            }

        };

Source: stackoverflow.com

Similar codes

0 vote113 views1 answer
Concurrentskiplistset infinite loop in jdk
Java
11 votes135 views1 answer
Age in java
Java
-1 vote138 views1 answer
Java get classpath
Java
0 vote132 views1 answer
How to draw a triangle in java
Java
0 vote129 views1 answer
Can you override static methods in java
Java
1 vote115 views1 answer
Char to string jva
Java
6 votes122 views1 answer
Java create a set with values
Java
9 votes132 views4 answers
Java clear console
Java
0 vote120 views1 answer
NumberFormatException!
Java
0 vote117 views10 answers
Bruh
Java