Question

Disadvantages of linked list representation of binary trees over arrays?

(a) Randomly accessing is not possible

(b) Extra memory for a pointer is needed with every element in the list

(c) Difficulty in deletion

(d) Random access is not possible and extra memory with every element

I need to ask this question from Binary Trees using Linked Lists in section Binary Trees of Data Structures & Algorithms I

I had been asked this question in a job interview.

Answer 1

Right option is (d) Random access is not possible and extra memory with every element

Easy explanation - Random access is not possible with linked lists.