JAVA EXAMPLE PROGRAMS

JAVA EXAMPLE PROGRAMS


Program: Basic LinkedList Operations.


Description:

Here we can see example for basic operations like creating object for LinkedList, adding objects into LinkedList, searching an object in LinkedList, whether it is listed under this LinkedList instance or not, checking whether the LinkedList is empty or not, and finally size of the LinkedList.


Code:
package com.java2novice.linkedlist;

import java.util.LinkedList;

public class MyBasicOperations {

	public static void main(String a[]){
		
		LinkedList<String> ll = new LinkedList<String>();
		ll.add("Orange");
		ll.add("Apple");
		ll.add("Grape");
		ll.add("Banana");
		System.out.println(ll);
		System.out.println("Size of the linked list: "+ll.size());
		System.out.println("Is LinkedList empty? "+ll.isEmpty());
		System.out.println("Does LinkedList contains 'Grape'? "+ll.contains("Grape"));
	}
}

Output:
[Orange, Apple, Grape, Banana]
Size of the linked list: 4
Is LinkedList empty? false
Does LinkedList contains 'Grape'? true
Next Program >>
blog comments powered by Disqus

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 Center
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.

About Author

My name is 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 at java2novice@gmail.com or you can comment on the page.

Most Visited Pages

Other Interesting Sites

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