Advantages of linked list representation of binary trees over arrays?
A. dynamic size
B. ease of insertion/deletion
C. ease in randomly accessing a node
D. both dynamic size and ease in insertion/deletion
Answer:B
Advantages of linked list representation of binary trees over arrays?
A. dynamic size B. ease of insertion/deletion C. ease in randomly accessing a node D. both dynamic size and ease in insertion/deletion