Pert5 Flashcards Preview

Data Structures > Pert5 > Flashcards

Flashcards in Pert5 Deck (6):
1

4 kondisi jika mau hapus doubly linked list?

• 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.

2

Threaded binary tree?

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

3

4 properti binary tree?

– 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).

4

Degree adalah?

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

5

perfect binary tree?

itu kiri sama kanan sama total

6

perfect binary tree juga disebut?

complete binary tree