/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

2 votes306 views1 answer
Java difference ++i and i++ loop
Java
1 vote306 views1 answer
Java trim string to length
Java
0 vote279 views10 answers
Arrays with for loops
Java
1 vote302 views1 answer
Java how to get elapsedTime
Java
6 votes286 views2 answers
Storage permission android
Java
0 vote303 views1 answer
Bigint is built in object
Java
0 vote322 views1 answer
Phone call using intent in Android
Java
1 vote290 views1 answer
Java jtextfield text bold
Java
0 vote301 views1 answer
Calling activity method from fragment:
Java
21 votes339 views4 answers
Java 2 decimals
Java