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.");
            }

        };

iterate trough linked list java

#Enhances For Loop
for (String temp : linkedList) {
    System.out.println(temp);
}

Java Iterating through LinkedList

import java.util.LinkedList;

class Main {
    public static void main(String[] args) {
        // Creating a linked list
        LinkedList<String> animals = new LinkedList<>();
        animals.add("Cow");
        animals.add("Cat");
        animals.add("Dog");
        System.out.println("LinkedList: " + animals);

        // Using forEach loop
        System.out.println("Accessing linked list elements:");
        for(String animal: animals) {
            System.out.print(animal);
            System.out.print(", ");
        }
    }
}

Iterating through a linked list

#include<stdio.h>
#include<stdlib.h>

//1
typedef struct node{
	int value;
	struct node *next;
}node;


int main(){
	int length,i;

	//2
	printf("Enter size of the list : ");
	scanf("%d",&length);

	//3
	struct node *headNode, *currentNode, *temp;

	//4
	for(i=0 ; i<length; i++){ //5 currentNode = (node *)malloc(sizeof(node)); //6 printf("Enter element %d : ",(i+1)); scanf("%d", ¤tNode->value);

		//7
		if(i==0){
			headNode = temp = currentNode;
		}else{
			//8
			temp->next = currentNode;
			temp = currentNode;
		}
	}

	//9
	temp->next = NULL;

	//10
	temp = headNode;

	//11
	printf("Iterating through the elements of the linked list : 
");
	while(temp != NULL){
		//12
		printf("%d 
",temp->value);
		temp = temp -> next;
	}
}