Algoritma dan Struktur Datahttp://www.unhas.ac.id/amil/S1TIF/StrukturData/

L4. Singly Linked Structure

Amil Ahmad Ilham

1

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

Singly Linked Structure

• Head: pointer to the first node

• The last node points to NULL

A

Head

B C

3

Singly Linked Node ObjectNode node1 = null;

node1

Node node2 = new Node(“A”, null);

node2

A

4

Singly Linked Node Object

Node node2 = new Node(“A”, null);

node2

A

Node node3 = new Node(“B”, node2);

node2

A

node3

B

5

Singly Linked Node ObjectNode node1 = null;

node1

Node node2 = new Node(“A”, null);

node2

A

node1 = node2;

node2

A

node1

6

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

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

Singly Linked Node Objectnode2 = node5;

C

node2

A

node1

D

node5

C

node2

A

node1

DC

node2

A

node1

D

node5

node5 = null;

9

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

Implementasi Queue dengan Singly Linked List

• Node.java

• Queue.java

• LinkedQueue.java

• QueueEmptyException.java

• QueueTest.java

11

Node.java

12

Queue.java

13

LinkedQueue.java

14

LinkedQueue.java

15

QueueEmptyException.java

16

QueueTest.java

17

Output

18

Tugas

• Untuk periapan kuiz, pelajari class LinkedQueue, run QueueTestdengan benar sehingga outputnya sama dengan output di slide 18. Tidak perlu diupload ke Sikola.

19