5-variasi list linier

24
Struktur Data S1 Teknik Informatika Fakultas Teknologi Informasi Universitas Kristen Maranatha / / / /2009  1

Upload: avner-malendes

Post on 14-Oct-2015

106 views

Category:

Documents


0 download

DESCRIPTION

variasi list linier

TRANSCRIPT

  • 5/24/2018 5-Variasi List Linier

    1/24

    Struktur Data

    S1 Teknik Informatika

    Fakultas Teknologi InformasiUniversitas Kristen Maranatha

    / // /2009 1

  • 5/24/2018 5-Variasi List Linier

    2/24

    / // /2009 2

  • 5/24/2018 5-Variasi List Linier

    3/24

    :

    :

    / //

    /2009 3

  • 5/24/2018 5-Variasi List Linier

    4/24

    :

    :

    : < : ,

    : :

  • 5/24/2018 5-Variasi List Linier

    5/24

    :

    :

    :

    / //

    /2009 5

  • 5/24/2018 5-Variasi List Linier

    6/24

    / //

    /2009 6

    12

    12

    12

    32

    12

    18

    3218

  • 5/24/2018 5-Variasi List Linier

    7/24

    Prosedur InsertLast

    (input/output L:List, P:address)Kamus

    Algoritma

    if (IsEmpty(L))then Head(L) P

    Tail(L) Pelse Tail(L).next P

    Tail(L) Pendif

    / //

    /2009 7

  • 5/24/2018 5-Variasi List Linier

    8/24

    / //

    /2009 8

    32

    12

    18

    123218

    12

    12

  • 5/24/2018 5-Variasi List Linier

    9/24

    Prosedur DeleteLast (input/output L:List,output

    P:address)

    KamusprevLast : addressAlgoritma

    P Tail(L)

    then Tail(L) null; Head(L) nullelse prevLast Head(L)

    while (prevLast.next Tail(L)) do

    prevLast prevLast.nextendwhile

    prevLast.next nullTail(L) prevLast

    endif

    / //

    /2009 9

  • 5/24/2018 5-Variasi List Linier

    10/24

    :

    :

    :

    / //

    /2009 10

    3

    1

  • 5/24/2018 5-Variasi List Linier

    11/24

    :

    :

    : < : ,

    , :

    :

  • 5/24/2018 5-Variasi List Linier

    12/24

    :

    :

    :

    / //

    /2009 12

  • 5/24/2018 5-Variasi List Linier

    13/24

    / //

    /2009 13

    3

    3

    23

    3

    12

    3 23 12

    head

  • 5/24/2018 5-Variasi List Linier

    14/24

    Prosedur InsertFirst

    (input/output L:List, P:address)Kamus

    Algoritma

    if (IsEmpty(L))then Head(L) P

    else P.next Head(L)Head(L).prev PHead(L) P

    endif / //

    /2009 14

  • 5/24/2018 5-Variasi List Linier

    15/24

    head

    / //

    /2009 15

    73

    30

    12

    30 73 12

    3

    3

  • 5/24/2018 5-Variasi List Linier

    16/24

    Prosedur DeleteFirst

    (input/output L:List,output P:address)

    Kamus

    Algoritma

    if (Head(L).next = null)then Head(L) nullelse Head(L) Head(L).next

    Head(L).prev nullP.next nullendif

    / //

    /2009 16

  • 5/24/2018 5-Variasi List Linier

    17/24

    :

    / //

    /2009 17

    1

    3

  • 5/24/2018 5-Variasi List Linier

    18/24

    :

    :

    : < : ,

    :

    :

  • 5/24/2018 5-Variasi List Linier

    19/24

    :

    :

    :

    / ///2009 19

  • 5/24/2018 5-Variasi List Linier

    20/24

    / //

    /2009 20

    3

    3

    32

    32

    15

    18

    1815

  • 5/24/2018 5-Variasi List Linier

    21/24

    Prosedur InsertFirst

    (input/output L:List, P:address)

    Kamus Last : addressAlgoritma

    if (Head(L)=null)

    then P.next P; Head(L) Pelse

    Last Head(L)while (Last.next Head(L)) do

    Last Last.nextendwhile

    Last.next PP.next Head(L); Head(L) P

    endif

    / //

    /2009 21

  • 5/24/2018 5-Variasi List Linier

    22/24

    / //

    /2009 22

    3

    3

    3 34

    34

    73

    73

    3

  • 5/24/2018 5-Variasi List Linier

    23/24

    Prosedur DeleteFirst

    (input/output L:List,output P:address)

    Kamus Last : addressAlgoritma

    P Head(L)

    if Head L .next = Head L

    then P.next null; Head(L) nullelse Last Head(L)while (Last.next Head(L)) do

    Last Last.nextendwhile

    Head(L) Head(L).nextLast.next Head(L)

    endif

    / //

    /2009 23

  • 5/24/2018 5-Variasi List Linier

    24/24

    & ,

    , ,

    ,

    , ,

    / //

    /2009 24