tailieunhanh - Lecture ECE 250 - Algorithms and data structures: Node-based storage with arrays

In this presentation, we covered: Dealing with node-based allocation with arrays; internally, it is still a linked list, only the nodes are contiguous in memory; it is no longer necessary to call the operating system for each new node; doubling the memory used is straight-forward; to halve the memory used, we just follow the linked list. | WATERLOO ENGINEERING 2006-2013 University of Waterloo O Douglas Wilhelm Harder . L - ctrical and Computer El Xanada Node-based storage with arrays WATER FENGINEERING w -Node-based storage with arrays 2 Outline In this presentation we will cover - The costs of node-based storage - Using an array for node-based storage - Having multiple linked lists within a single structure - Reallocation of memory WATER FENGINEERING w -Node-based storage with arrays 3 The issue A significant issue with linked lists and later trees are that nodebased data structures require n calls to new - This requires a call to the operating system requesting a memory .