In this post we will see Difference between ArrayList and LinkedList in java along with examples. Implementation a. ArrayList implements the List Interface , LinkedList implements the List and Dequ
LinkedList push and pop methods
Adding and removing element in LinkedList can also be done by push and pop methods. 1. void push(E e) – Adds an element into the List as the first element 2. [crayon-68e8d
LinkedList poll method examples
LinkedList provides 3 methods to get elements and remove them from the list.
1 2 3 |
E poll() E pollFirst() E pollLast() |
LinkedList peek methods example
LinkedList provides 3 methods to get elements without removing it apart from the conventional get(index)
1 2 3 |
E peek() E peekFirst() E peekLast() |
LinkedList descendingIterator example
LinkedList descendingIterator() method returns an iterator over the elements in reverse order. Method:
1 |
public Iterator<E> descendingIterator() |
LinkedList ListIterator Java example
In this post we will see various LinkedList ListIterator Java examples. ListIterator in LinkedList can be used to iterate a list from a specified position. Method :
1 |
public ListIterator<E> listIterator(int index) |
How to Iterate LinkedList in java
In this post we will see how to iterate LinkedList in java. We can iterate LinkedList either using 1. For loop 2. Iterator. 3. ListIterator 4. While loop We will see examples for all these methods.
removeFirst and removeLast in LinkedList
Apart from the usual remove() , remove(int index) and remove(Object o) we can use 4 other methods to remove elements from LinkedList. The
addFirst and addLast methods in LinkedList
Apart from add(E e) and add(int index, E element) methods, we have addFirst and addLast methods in LinkedList to add elements. 1. [crayon-68e8d7aa5190a494206369-i
How to remove elements from LinkedList
In this post we will see methods on how to remove elements from LinkedList. We will see example using remove() , remove(int index) and [crayon-68e8d7aa51b