Tugas 2 : Membuat Binary Tree 

Tugas 2 : Membuat Binary Tree Berdasarkan Nama (FIKA DWI YULI ASTUTIK)

FIKADWIYULIASTUTIK

Keterangan

F              =             Root

I               =             I > F = Kanan

K             =             K > F = Kanan

                                K > I = Kanan

A             =             A < F = Kiri

D             =             D < F = Kiri

                                D > A = Kanan

W            =             W > F = Kanan

                                W > I = Kanan

                                W > K = Kanan

I               =             I > F = Kanan

                                I > I = Kanan

                                I < K = Kiri

Y              =             Y > F = Kanan

                                Y > I = Kanan

                                Y > K = Kanan

                                Y > W = Kanan

U             =             U > F = Kanan

                                U > I = Kanan

                                U > K = Kanan

                                U < W = Kiri

L              =             L > F = Kanan

                                L > I = Kanan

                                L > K = Kanan

                                L < W = Kiri

                                L < U = Kiri

I               =             I > F = Kanan

                                I < K = Kiri

                                I > I = Kanan

A             =             A < F = Kiri

                                A > A = Kanan

                                A < D = Kiri

S              =             S > F = Kanan

                                S > I = Kanan

                                S > K = Kanan

                                S < W = Kiri

                                S < U = Kiri

                                S > L = Kanan

T              =             T > F = Kanan

                                T > I = Kanan

                                T > K = Kanan

                                T < W = Kiri

                                T < U = Kiri

                                T > L = Kanan

                                T > S = Kanan

U             =             U > F = Kanan

                                U > I = Kanan

                                U > K = Kanan

                                U < W = Kiri

                                U > U = Kanan

T              =             T > F = Kanan

                                T > I = Kanan

                                T > K = Kanan

                                T < W = kiri

                                T < U = Kiri

                                T > L = Kanan

                                T > S = Kanan

                                T > T = Kanan

I               =             I > F = Kanan

                                I > I = Kanan

                                I < K = Kiri

                                I > I = Kanan

                                I > I = Kanan

K             =             K > F = Kanan

                                K > I = Kanan

                                K > K = Kanan

                                K < W = Kiri

                                K < U = Kiri

                                K < L = Kiri

Element-Element Di Binary Tree :

     1.Root                      = F

     2.Leaf                       = A , I, K, T, U, Y

     3. Parent(W)           = K

     4. Child(W)              = U ,Y

     5. Sibling(y)             = U

     6.Ancestor(A)       = A, D, A, F

     7. Descendent(L)  = K, S, T, T

     8.Path(F ,A)            = F => A => D => A

     9.Size                        = 18

     10.Height                   = 9