+1 vote
in Data Structures & Algorithms I by (110k points)
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.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (d) both dynamic size and ease in insertion/deletion

The best I can explain: It has both dynamic size and ease in insertion and deletion as advantages.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...