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
This interesting question is from Binary Trees using Linked Lists in division Binary Trees of Data Structures & Algorithms I
I got this question in my homework.