/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 vote186 views1 answer
Java number padding zeros
Java
4 votes191 views3 answers
Jframe in middle of screen java
Java
0 vote238 views1 answer
Java compile
Java
0 vote187 views2 answers
Failed to determine a suitable driver class
Java
0 vote180 views1 answer
Plus One Java
Java
1 vote185 views1 answer
Why can we implement multiple interfaces in java
Java
1 vote199 views1 answer
Rwegex java
Java
0 vote190 views1 answer
Spring boot bean configuration
Java
0 vote182 views1 answer
Java code to get all leaf nodes of a xml
Java
0 vote201 views1 answer
How much epsom salt should strawberries need
Java