SEARCH
You are in browse mode. You must login to use MEMORY

   Log in to start


From course:

Computer Science AQA A level

» Start this Course
(Practice similar questions for free)
Question:

State the disadvatantages of dynamic structures

Author: Will Parker



Answer:

Resize operation takes time​ In dynamic structures such as a linked list the access time depends on the position of the element in the structure​ Storage overhead for pointers (linked lists and trees)​


0 / 5  (0 ratings)

1 answer(s) in total