Pert5

Question 1

4 kondisi jika mau hapus doubly linked list?

Answer 1

• The node to be deleted is the only node in linked list.
• The node to be deleted is head.
• The node to be deleted is tail.
• The node to be deleted is not head or tail.

Question 2

Threaded binary tree?

Answer 2

store null pointer di kiri dan kanan field. jadi null pointer tersebut point ke node yang ada isinya.

Question 3

4 properti binary tree?

Answer 3

– Every node has a key and no two nodes have the
same key (keys are unique).
– Left sub tree’s keys are smaller than root’s key.
– Right sub tree’s keys are larger than root’s key.
– The left and right sub trees are also binary search tree (recursively).

Question 4

Degree adalah?

Answer 4

jumlah maksimum child dari node yang disebut. jika hanya disebut degree of tree. coba liat node yang paling banyak child nya.

Question 5

perfect binary tree?

Answer 5

itu kiri sama kanan sama total

Question 6

perfect binary tree juga disebut?

Answer 6

complete binary tree