![Page 1: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/1.jpg)
Algoritma dan Struktur Datahttp://www.unhas.ac.id/amil/S1TIF/StrukturData/
L4. Singly Linked Structure
Amil Ahmad Ilham
1
![Page 2: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/2.jpg)
Singly Linked Structure
• A linked list is a series of connected nodes.
• Each node contains at least• A piece of data (any type)
• Pointer to the next node in the list
A
data pointer
node
2
![Page 3: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/3.jpg)
Singly Linked Structure
• Head: pointer to the first node
• The last node points to NULL
A
Head
B C
3
![Page 4: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/4.jpg)
Singly Linked Node ObjectNode node1 = null;
node1
Node node2 = new Node(“A”, null);
node2
A
4
![Page 5: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/5.jpg)
Singly Linked Node Object
Node node2 = new Node(“A”, null);
node2
A
Node node3 = new Node(“B”, node2);
node2
A
node3
B
5
![Page 6: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/6.jpg)
Singly Linked Node ObjectNode node1 = null;
node1
Node node2 = new Node(“A”, null);
node2
A
node1 = node2;
node2
A
node1
6
![Page 7: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/7.jpg)
Singly Linked Node Object Node node4 = new Node(“C”, null);
node2.next = node4;
C
node2
A
node2 = node4;
node1
node1 = node2;
node2
A
node1
C
node4
node4
C
node2
A
node1 node4
7
![Page 8: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/8.jpg)
Singly Linked Node ObjectNode node5 = new Node(“D”, null);node2 = node4;
node2.next = node5;
C
node2
A
node1 node4
C
node2
A
node1 node4
D
node5
node4 = null;
D
node5
C
node2
A
node1 node4
D
node5
node2 = node5;
C
node2
A
node1
D
node5
8
![Page 9: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/9.jpg)
Singly Linked Node Objectnode2 = node5;
C
node2
A
node1
D
node5
C
node2
A
node1
DC
node2
A
node1
D
node5
node5 = null;
9
![Page 10: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/10.jpg)
Singly Linked Node Object
//return Areturn node1.element;
C
node2
A
node1
D
node1 = node1.next
C
node2
A
node1
D C
node2
node1
D
10
![Page 11: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/11.jpg)
Implementasi Queue dengan Singly Linked List
• Node.java
• Queue.java
• LinkedQueue.java
• QueueEmptyException.java
• QueueTest.java
11
![Page 12: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/12.jpg)
Node.java
12
![Page 13: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/13.jpg)
Queue.java
13
![Page 14: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/14.jpg)
LinkedQueue.java
14
![Page 15: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/15.jpg)
LinkedQueue.java
15
![Page 16: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/16.jpg)
QueueEmptyException.java
16
![Page 17: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/17.jpg)
QueueTest.java
17
![Page 18: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/18.jpg)
Output
18
![Page 19: Algoritma dan Struktur Data Struktur Data OL.pdf · Singly Linked Structure •A linked list is a series of connected nodes. •Each node contains at least •A piece of data (any](https://reader033.vdocuments.us/reader033/viewer/2022051606/6017302082ed680a4e5207c3/html5/thumbnails/19.jpg)
Tugas
• Untuk periapan kuiz, pelajari class LinkedQueue, run QueueTestdengan benar sehingga outputnya sama dengan output di slide 18. Tidak perlu diupload ke Sikola.
19