JAVA EXAMPLE PROGRAMS

JAVA EXAMPLE PROGRAMS

Checkout for Promo Codes

Program: How to reverse LinkedList content?


Description:

This example shows how to reverse LinkedList content. You can reverse the content by calling Collections.reverse() method. You have to pass LinkedList instance to this method, which reverses the content.


Code:
package com.java2novice.linkedlist;

import java.util.Collections;
import java.util.LinkedList;

public class MyLinkedListReverse {

	public static void main(String a[]){
		
		LinkedList<String> list = new LinkedList<String>();
		list.add("Java");
		list.add("Cric");
		list.add("Play");
		list.add("Watch");
		list.add("Glass");
		Collections.reverse(list);
		System.out.println("Results after reverse operation:");
		for(String str: list){
			System.out.println(str);
		}
	}
}

Output:
Results after reverse operation:
Glass
Watch
Play
Cric
Java
<< Previous Program | Next Program >>

List Of All LinkedList Sample Programs:

  1. Basic LinkedList Operations.
  2. How to read all elements in LinkedList by using iterator?
  3. How to copy or clone a LinkedList?
  4. How to add all elements of a list to LinkedList?
  5. How to delete all elements from my LinkedList?
  6. How to find does LinkedList contains all list elements or not?
  7. How to copy LinkedList to array?
  8. How to get sub list from LinkedList?
  9. How to sort LinkedList using Comparator?
  10. How to reverse LinkedList content?
  11. How to shuffle elements in LinkedList?
  12. How to swap two elements in a LinkedList?
  13. How to convert list to csv string format?
  14. How to add element at first position in LinkedList?
  15. How to add element at last position in LinkedList?
  16. How to read first element from LinkedList?
  17. How to read last element from LinkedList?
  18. How to iterate through LinkedList in reverse order?
  19. LinkedList push(), pop() operations examples.
  20. How to remove elements from LinkedList?
Knowledge Centre
When to use LinkedList or ArrayList?
Accessing elements are faster with ArrayList, because it is index based. But accessing is difficult with LinkedList. It is slow access. This is to access any element, you need to navigate through the elements one by one. But insertion and deletion is much faster with LinkedList, because if you know the node, just change the pointers before or after nodes. Insertion and deletion is slow with ArrayList, this is because, during these operations ArrayList need to adjust the indexes according to deletion or insetion if you are performing on middle indexes. Means, an ArrayList having 10 elements, if you are inserting at index 5, then you need to shift the indexes above 5 to one more.
Famous Quotations
Insanity: doing the same thing over and over again and expecting different results.
-- Albert Einstein

About Author

I'm Nataraja Gootooru, programmer by profession and passionate about technologies. All examples given here are as simple as possible to help beginners. The source code is compiled and tested in my dev environment.

If you come across any mistakes or bugs, please email me to [email protected].

Most Visited Pages

Other Interesting Sites

Reference: Java™ Platform Standard Ed. 7 - API Specification | Java™ Platform Standard Ed. 8 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2022 by Nataraja Gootooru. All Rights Reserved.