Java Linked List Tutorial | Edureka
4 likes2,416 views
The document explains linked lists as a dynamic data structure where nodes are interconnected and includes elements such as head, nodes, and tail. It distinguishes between different types of linked lists: singly linked lists, doubly linked lists, and circular linked lists, as well as comparing arrays and linked lists in terms of memory consumption, resizing capability, and operation speed. The document also highlights methods in linked lists and their features, emphasizing their synchronization and maintenance of insertion orders.
![My Array[0] My Array[1] My Array[2] My Array[3] My Array[4]
=My Array[0] 10
ArrayRefVar = new dataType[arraySize];
=My Array new int[5]
What happens in an Array?
www.edureka.co](https://image.slidesharecdn.com/linkedlistsinjava-191018102444/85/Java-Linked-List-Tutorial-Edureka-5-320.jpg)
![=My Array[2] 30
=My Array[3] 40
=My Array[4] 50
=My Array[1] 20
My Array[0] My Array[1] My Array[2] My Array[3] My Array[4]
10
ArrayRefVar = new dataType[arraySize];
=My Array new int[5]
What happens in an Array?
www.edureka.co](https://image.slidesharecdn.com/linkedlistsinjava-191018102444/85/Java-Linked-List-Tutorial-Edureka-6-320.jpg)
![My Array[0] My Array[1] My Array[2] My Array[3] My Array[4]
10 30 40 5020
ArrayRefVar = new dataType[arraySize];
=My Array new int[5]
What happens in an Array?
www.edureka.co](https://image.slidesharecdn.com/linkedlistsinjava-191018102444/85/Java-Linked-List-Tutorial-Edureka-7-320.jpg)
Java Linked List Tutorial | Edureka
- 1. Copyright © 2017, edureka and/or its affiliates. All rights reserved.
- 2. FEATURES OF LINKED LISTS METHODS IN LINKED LISTS TYPES OF LINKED LISTS ARRAYS V/S LINKED LISTS WHAT IS A LINKED LIST? www.edureka.co
- 3. What is a Linked List? www.edureka.co
- 4. What is a Linked List? A Linked List a Data Structure similar to arrays, where each node is interconnected to the next node through a memory address link. A Linked List has three Elements, Namely: • Head • Nodes • Tail www.edureka.co
- 5. My Array[0] My Array[1] My Array[2] My Array[3] My Array[4] =My Array[0] 10 ArrayRefVar = new dataType[arraySize]; =My Array new int[5] What happens in an Array? www.edureka.co
- 6. =My Array[2] 30 =My Array[3] 40 =My Array[4] 50 =My Array[1] 20 My Array[0] My Array[1] My Array[2] My Array[3] My Array[4] 10 ArrayRefVar = new dataType[arraySize]; =My Array new int[5] What happens in an Array? www.edureka.co
- 7. My Array[0] My Array[1] My Array[2] My Array[3] My Array[4] 10 30 40 5020 ArrayRefVar = new dataType[arraySize]; =My Array new int[5] What happens in an Array? www.edureka.co
- 8. What happens in Linked List? Memory Heap www.edureka.co
- 9. 10 30 40 50 20 7328 30261001 4537 1023 What happens in Linked List? www.edureka.co
- 10. Null50 302630100110 453740 102320 What happens in Linked List? www.edureka.co
- 11. 100110 102320 453740302630 Null50 What happens in Linked List? Head Tail Nodes www.edureka.co
- 12. Types of Linked Lists www.edureka.co
- 13. Types of Linked Lists Singly Linked List Circular Linked List Doubly Linked List www.edureka.co
- 14. AdrHead AdrNode AdrNodeAdrNode NullTail Singly Linked List A Singly Linked List nodes contains two fields, Namely: • Address of the next node • Data assigned to the present node www.edureka.co
- 15. AdrHead Doubly Linked List A Doubly Linked List nodes contains three fields, Namely: • Address of the next node • Address of the previous node • Data assigned to the present node Null AdrNodeAdr AdrNodeAdr AdrNodeAdr NullTailAdr www.edureka.co
- 16. AdrHead AdrNodeAdrNode AdrNode HeadTail Circular Linked List www.edureka.co
- 17. Features of Linked Lists www.edureka.co
- 18. Que and Deque Interfaces Linked Lists are SynchronizedInclude Duplicates List IteratorMultithreaded Environment Maintains Insertion orders No Random Access Features of Linked Lists www.edureka.co
- 19. Methods in Linked Lists www.edureka.co
- 20. www.edureka.co Convert Array to Linked List
- 21. www.edureka.co Convert Linked List to Array
- 22. Array v/s Linked Lists www.edureka.co
- 23. Arrays v/s Linked Lists Arrays are not Resizable Linked Lists are Dynamically Resizable www.edureka.co
- 24. Arrays v/s Linked Lists Arrays offer more Methods Comparatively, Fewer Methods are available in Linked Lists www.edureka.co
- 25. Arrays v/s Linked Lists Insertion, addition and removal operations of an item are faster in arrays Comparatively, operations are slow in Linked Lists www.edureka.co
- 26. Arrays v/s Linked Lists Arrays consume more Memory Linked Lists consume Less Memory www.edureka.co
- 28. www.edureka.co