/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 vote110 views1 answer
Assertthat code throws exception
Java
0 vote104 views1 answer
Set path in windows
Java
0 vote106 views1 answer
Single responsibility
Java
0 vote107 views3 answers
Java regex 10 digit number
Java
0 vote105 views1 answer
How to change color page in latex
Java
0 vote103 views1 answer
How to add textview to listview in android
Java
7 votes110 views1 answer
Android join array
Java
20 votes97 views6 answers
Java array
Java
1 vote97 views1 answer
Android how to don't show keyboard
Java
4 votes113 views4 answers
Android volley
Java