Pertemuan Ketujuh

STACK (TUMPUKAN)

3

4

4

Int B = 4 ;

Int c *, * D ;

Int A  = 3 ;

-7

-5

4

C = & A ;

Cout << * C ;

D = & B ;

Cout << * D ;

B = -5 ; A = -7 ;

Cout << * D << * C ;

Ø  2 cara mendeklarasikan bilangan NODE :

?

a.       Node * A ; A→

b.      Node A ; A

A.into = 3 ;

3

A.berikut = NULL A

Delete A

Node * A = new Node ;

A.into = 5 ;

5

A.berikurt = NULL

4

NULL

               Struct Node {

               Int into ;

               Node * berikut ;

               }

Struct Node {

Int into ;

Node * berikut ;

}

Delete Q {

Node * Q = new node ;

Q.into = 7 ;

Q.berikut NULL

}

Int Q = 7 ;

Cout << * C ;

Ø  Class Node {

Public ;

Int data ;

Node * berikut ;

};

Node * Q = new node ;

Q → data = 7 ;

Q → berikut = NULL ;

Node * P = new node ;

P → data = 3 ;

P → berikut = NULL ;

Q → berikut = P ;

Ø  Jalan = p ;

While jalan →berikut ; ! = NULL {

Jalan = jalan → berikut ;

Cout << jalan → into ;

Cout << P → berikut → into ;

Cout << p → berikut → berikut = S ;

Cout << p → berikut → berikut → berikut  = T