Question

Write The Advantages Of Memory Efficient Doubly Linked List

Answer 1

Answer:

please mark me as a brainlist

Explanation:

Advantage: We save a lot of memory space. For each node we are saving one pointer, if there are n nodes then our memory consumption is reduced by O(n). If we want to reverse the doubly linked list (pre will become next & vice-versa) it is O(n) operation (pointers need to be changed for each node).

Answer 2

Answer:

We save a lot of memory space. For each node we are saving one pointer, if there are n nodes then our memory consumption is reduced by O(n). If we want to reverse the doubly linked list (pre will become next & vice-versa) it is O(n) operation (pointers need to be changed for each node).

plz mark me as brainliest plz