/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 vote365 views1 answer
Change color in recyclerview
Java
0 vote359 views1 answer
Lombok boolean is prefix
Java
0 vote361 views1 answer
Set precision in java
Java
-1 vote415 views3 answers
Cors spring
Java Spring
0 vote338 views1 answer
Arrays vs collections
Java
1 vote330 views1 answer
Java create xml
Java
0 vote437 views1 answer
How to generate randome number in desired range java
Java
3 votes337 views4 answers
How to make JFrame full screen
Java
3 votes465 views3 answers
Spring xml
Java Spring
0 vote361 views1 answer
How to write 1,2,3,4.... in java
Java