/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 vote334 views1 answer
Stringbuilser
Java
0 vote377 views1 answer
@crossorigin spring allow all
Java Spring
0 vote324 views1 answer
Java print method
Java
0 vote314 views1 answer
Android java xml combo box
Java
0 vote297 views2 answers
Uninstall java 11 linux
Java
0 vote338 views1 answer
Delete Specials Caractères from a String in java
Java
0 vote298 views1 answer
Httpsession vs cookie servlet
Java
1 vote297 views1 answer
How to set list data to android spinner
Java
0 vote298 views1 answer
Get array element java
Java
1 vote309 views1 answer
Imagesbutton how to set background
Java