Nobi-Algo-DS

Just some Data Structures

1- Linked Lists:

Here, we will see the idea of using linked lists (in JAVA 8) and what they are. The main idea behind using linked list over arrays is that the insertion and deletion, here, has time complexity of O(1). The code of using and coding the linked lists is provided here. Following methods and constructs have been covered and coded using Java 8:

1. Creating a Node for linked lists.
2. The method for basic insertion of element
   • Adding elemnent in the start
   • Adding element at the last
   • Adding element anywhere w.r.t. the index provided.
3. Method for deleteion for element at a given index.
4. Method for reversing the list
5. Method for finding length and printing the list. << More To Add >>

2- Graphs: