1 6.3 & 7.3 nested loop linear doubly linked list insert kiri

28
1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

Upload: ulysses-stigger

Post on 01-Apr-2015

278 views

Category:

Documents


3 download

TRANSCRIPT

Page 1: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

1

6.3 & 7.3NESTED LOOP

Linear DoublyLinked List

INSERT KIRI

Page 2: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

2

INSERT KIRIMenambah simpul baru diujung paling kiri Linked List

yang sudah ada Disebut juga

INSERT AWAL

3.08

Page 3: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

3

3.08

Kalau sudah ada 4 buah simpul, INSERT KIRI akan menginsert simpul yang baru di buat, diujung paling kiri menjadi simpul no. (5)

(5)

10

INFO

RIG

HT

LEFT

LAST

17

INFO

RIG

HT

LEFT

12

INFO

LEFT

25

RIG

HT

INFO

LEFT

RIG

HT

FIRST

(1)(2)(3)(4)

Page 4: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

4

3.05

sudah ada simpul awalsebagai berikut :

INFO

RIG

HT

LEFT

FIRST

LAST

25

(1)

P

Page 5: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

5

3.05

akan dibuat simpul baruyang akan diinsert disini

Perhatikan pointer Pmenujuk simpul yang barutidak menunjuk simpul yang lama lagi

INFO

RIG

HTP

LEFT

12

(2)

INFO

RIG

HT

LEFT

FIRST

LAST

25

(1)

Page 6: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

6

3.05

sehingga akan ter-linksebagai berikut :

INFO

RIG

HTP

LEFT

12

(2)

INFO

RIG

HT

LEFT

FIRST

LAST

25

(1)

Page 7: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

7

3.05

void Awal (void){ int X; scanf(“%i”, &X); P = (Simpul *) malloc(sizeof(Simpul)); P->INFO = X; LAST->LEFT = P; P->RIGHT = LAST; LAST = P; P->LEFT = NULL;}

1)2)3)4)5)6)

Algoritma Membuat Simpul BaruDan INSERT KIRI

INFO

RIG

HT

LEFT

LAST FIRST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

Page 8: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

8

3.05

Algoritma tahap per tahap

Page 9: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

9

3.05

Membuat Simpul (2)

1)2)3)4)5)6)

P = (Simpul *) malloc(sizeof(Simpul));

P = (Simpul *) malloc(sizeof(Simpul)); P->INFO = X; LAST->LEFT = P; P->RIGHT = LAST; LAST = P; P->LEFT = NULL;

INFO

RIG

HT

LEFT

FIRST

INFO

RIG

HTP

LEFT

25

(2) (1)

LAST

Page 10: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

10

3.05

P->INFO diisi dengan nilai X

1)2)3)4)5)6)

P->INFO = X;

P = (Simpul *) malloc(sizeof(Simpul)); P->INFO = X; LAST->LEFT = P; P->RIGHT = LAST; LAST = P; P->LEFT = NULL;

INFO

RIG

HT

LEFT

FIRST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

LAST

Page 11: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

11

3.05

Pointer LEFT Simpul (1) menunjuk simpul (2)

1)2)3)4)5)6)

LAST->LEFT = P;

P = (Simpul *) malloc(sizeof(Simpul)); P->INFO = X; LAST->LEFT = P; P->RIGHT = LAST; LAST = P; P->LEFT = NULL;

INFO

RIG

HT

LEFT

FIRST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

LAST

Page 12: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

12

3.05

Pointer RIGHT simpul (2) menunjuk simpul (1)

1)2)3)4)5)6)

P->RIGHT = LAST;

P = (Simpul *) malloc(sizeof(Simpul)); P->INFO = X; LAST->LEFT = P; P->RIGHT = LAST; LAST = P; P->LEFT = NULL;

INFO

RIG

HT

LEFT

FIRST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

LAST

Page 13: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

13

3.05

Pointer LAST pindah menunjuk simpul terakhir

1)2)3)4)5)6)

LAST = P;

P = (Simpul *) malloc(sizeof(Simpul)); P->INFO = X; LAST->LEFT = P; P->RIGHT = LAST; LAST = P; P->LEFT = NULL;

INFO

RIG

HT

LEFT

FIRST

LAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

Page 14: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

14

3.05

Pointer LEFT simpul (2) diisi NULL

INFO

RIG

HT

LEFT

FIRST

LAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1)2)3)4)5)6)

P->LEFT = NULL;

P = (Simpul *) malloc(sizeof(Simpul)); P->INFO = X; LAST->LEFT = P; P->RIGHT = LAST; LAST = P; P->LEFT = NULL;

Page 15: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

15

3.05

LATIHANDI

KELAS

Page 16: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

16

3.05

Pertanyaan :1. Ada berapa buah simpul2. Ada berapa buah pointer Sebutkan nama dan isinya masing-masing

INFO

RIG

HTP

LEFT

12

(2)

INFO

RIG

HT

LEFT

FIRST

LAST

25

(1)

Page 17: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

17

3.05

1

2

3

4

6

5

7

INFO

RIG

HTP

LEFT

12

(2)

INFO

RIG

HT

LEFT

FIRST

LAST

25

(1)

Page 18: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

18

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

23

6

7

No Pointer Nama pointer isi

1

2

3

4

5

6

7

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

Page 19: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

19

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu :->LEFT yaitu :

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

6 ->LEFT yaitu :

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

NULL

Page 20: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

20

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu :

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

NULL

Page 21: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

21

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu :

3 ->LEFT yaitu :

5 ->LEFT yaitu :

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

&(2)

NULL

Page 22: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

22

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu :

3 ->LEFT yaitu : FIRST->LEFT

5 ->LEFT yaitu :

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

&(2)

NULL

Page 23: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

23

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu : FIRST->LEFT->LEFT

3 ->LEFT yaitu : FIRST->LEFT

5 ->LEFT yaitu :

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

&(2)

NULL

Page 24: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

24

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu : FIRST->LEFT->LEFT

3 ->LEFT yaitu : FIRST->LEFT

5 ->LEFT yaitu :

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

1 ->RIGHT yaitu :

2 ->RIGHT yaitu :

&(2)

&(1)

NULL

Page 25: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

25

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu : FIRST->LEFT->LEFT

3 ->LEFT yaitu : FIRST->LEFT

5 ->LEFT yaitu :

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

1 ->RIGHT yaitu : LAST->RIGHT

2 ->RIGHT yaitu : P->RIGHT

&(2)

&(1)

NULL

Page 26: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

26

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu : FIRST->LEFT->LEFT

3 ->LEFT yaitu : FIRST->LEFT

5 ->LEFT yaitu : LAST->RIGHT->LEFT P->RIGHT->LEFT

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

1 ->RIGHT yaitu : LAST->RIGHT

2 ->RIGHT yaitu : P->RIGHT

&(2)

&(1)

NULL

Page 27: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

27

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu : FIRST->LEFT->LEFT

3 ->LEFT yaitu : FIRST->LEFT

5 ->LEFT yaitu : LAST->RIGHT->LEFT P->RIGHT->LEFT

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

1 ->RIGHT yaitu : LAST->RIGHT

2 ->RIGHT yaitu : P->RIGHT

3 ->RIGHT yaitu :

5 ->RIGHT yaitu :

&(2)

&(1)

NULL

NULL

Page 28: 1 6.3 & 7.3 NESTED LOOP Linear Doubly Linked List INSERT KIRI

28

INFO

RIG

HT

LEFT

FIRSTLAST

12

INFO

RIG

HTP

LEFT

25

(2) (1)

1

45

2

3

6

7

No Pointer Nama pointer isi

4

5

6

7

1

2

->LEFT yaitu : LAST->LEFT->LEFT yaitu : P->LEFT

6 ->LEFT yaitu : FIRST->LEFT->LEFT

3 ->LEFT yaitu : FIRST->LEFT

5 ->LEFT yaitu : LAST->RIGHT->LEFT P->RIGHT->LEFT

1

2

3

LASTP

FIRST

No Nama isi&(2)

&(2)&(1)

1 ->RIGHT yaitu : LAST->RIGHT

2 ->RIGHT yaitu : P->RIGHT

3 ->RIGHT yaitu : FIRST->RIGHT

5 ->RIGHT yaitu : LAST->RIGHT->RIGHT P->RIGHT->RIGHT

&(2)

&(1)

NULL

NULL