Jawaban : UAS Struktur Data 2012

No. 1.

int soalku (int n) {

if (n<=0) return n;
else
return soalku (n-2);
}

No. 2.

a. Node *X;
X = S;

b. while(X->berikutnya != 0) {
X = X->berikutnya;
}
c. X->berikutnya = T;

No. 3. + + / + a b – c * d e f / * g h i
++/+ab–c*def/*ghi

+ + / (a + b) – c * d e f / * g h i
+ + / (a + b) – c (d * e) f / * g h i

+ + / (a + b) (c – (d * e)) f / * g h i

+ + (a + b) / (c – (d * e)) f / * g h i

+ (a + b) / (c – (d * e)) + f / * g h i
 + (a + b) / (c – (d * e)) + f / (g * h) i

+ (a + b) / (c – (d * e)) + f (g * h) / i

(a + b) / (c – (d * e)) + f + (g * h) / i

Pre-order : + + / + a b – c * d e f / * g h i
Post-order : a b + c d e * - / e + g h * a / +
 No. 4. Hasil akhir pohon atau array :

Setelah penghapusan elemen menjadi :