/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

3 votes128 views1 answer
How to add cardview support in android studio
Java
2 votes125 views1 answer
Java if one sting on array match
Java
1 vote110 views1 answer
Circular list java
Java
1 vote119 views1 answer
Fabric8 create namespace
Java
0 vote117 views1 answer
Java remove character from string after
Java
6 votes117 views1 answer
Save map to file java
Java
1 vote130 views1 answer
Java and or precedence
Java
1 vote124 views1 answer
Scala vs java
Java
0 vote129 views1 answer
Radio button lambda javafx
Java
0 vote105 views1 answer
Return class name java
Java