LinkedList learning

Different data structures lead to different characteristics , The linked list structure is good at handling the problem of adding and deleting （ Just modify the pointer of a few elements ）, Arrays are good for processing queries （ Array subscripts are easy to locate ）

The code is as follows
First in first out queue , Linked list form .

Elements are connected by storing each other's location information , Search slow , add to / Delete fast .

There is no data movement problem , Just modify the subsequent pointer .

public static void main(String[] args) {
    
        LinkedList list = new LinkedList();
        list.add("hello");
        list.add("world");

        System.out.println(list);
        list.addFirst("A");
        list.addLast("B");
        System.out.println(list);

        list.add(2,"2");
        System.out.println(list);

        // fifo   Add from left 
        list.push("javase");
        System.out.println(list);

        System.out.println(list.getFirst());
        System.out.println(list.peek());
        System.out.println(list.peekFirst());
        // Take the value out , Does not exist. 
        System.out.println(list.pop());
        System.out.println(list);
    }