Java Tutorials with Internals

The Linkedlist represents the chain of data nodes as list in java. The current node has the address or connection with the next node in single linked list and of previous node also in double linked list. To build custom linkedlist, please follow below 3 steps: 1. First, we need to construct the structure of linked list 2. Second, implement the operations of the linked list in another class 3. Third, test the functionality The source code of program Output: 12->454->89->1 12->454->1 45->12->454->1->23 abc->raj->kiran abc->raj 65->Gyan Look at my other posts: Stack in Java Custom Stack Implementation Set Interface in Java Custom Doubly LinkedList Implementation Custom LinkedList Implementation How to fetch elements from LinkedList List Traversal How to insert elements in List How to remove element from list How to declare Linked List and Implement LinkedList Traversal In Reverse Sequential Order ...

    In collection framework "Set" is an interface which has all the collection's methods with a contract of having only unique elements. It means if you want to save the n elements and m elements are duplicate out of them then set interface would contain only (n-m) elements and reject m elements during addition to the collection. Set can contain at most one null element. Output: Original Set :: [1, 2, 3] After Insertion test :: [1, 2, 3, 4]     Internally Set uses the hashmap while storing the elements. It has one static object declared which is used as value for this map. Whichever element we add in Set it adds it in the hashmap as a key. If the key is already present map returns the value of that key otherwise it returns null. So if we are getting the null from map, it means the value got added successfully. This property is used in the add method of Set. If we see the HashSet implementation we find the code like : public class HashSet ...