Okay, so now our interface is ready!Ĭoming back to Node class. The methods are also written to accept and return data of type T. The interface is written as IList, which can accept an appropriate type. So let's create an interface called IList.java and add the following code to it which has operations described above. For these operations we will define an interface which our Linked List class implements.
Generic linked list stack update#
Here we will discuss adding an item (at end), adding an item (element/data/value) at the begninning, adding an item at some position, get the value at particular position, get middle element, check if a value exists, update data at some position, reverse linked list, get the size of the linked list, check if list is empty, remove data at some position, delete given element, clear the linked list. Before creating that, what all opeations we perform in our Linked List? As linked list is a sequence of nodes, each node contains some data of type T (T can be int, float, char, String, etc) and a pointer (or reference) to the next node.
If our linked list is empty, this head value is null which points to nothing. Let's start with our linked list implementation.īefore discussing linked list implementation, I want to describe what linked list (I will mention linked list instead of singly linked list to save few key strokes) is:Ī linked list is represented by a pointer to the first node of the linked list. Code that uses generics has stronger type checks at compile time. In a nutshell, generics enable types (classes and interfaces) to be parameters when defining classes, interfaces and methods. But still you can follow the code, generics is not rocket science. I assume that you know what generics in Java is.
In this post, we will use Java generics to implement Singly Linked List and test it.
0 kommentar(er)
