- Python Data Structures and Algorithms
- Benjamin Baka
- 192字
- 2021-07-09 19:45:10
Pointer structures
Contrary to arrays, pointer structures are lists of items that can be spread out in memory. This is because each item contains one or more links to other items in the structure. What type of links these are dependent on the type of structure we have. If we are dealing with linked lists, then we will have links to the next (and possibly previous) items in the structure. In the case of a tree, we have parent-child links as well as sibling links. In a tile-based game where the game map is built up of hexes, each node will have links to up to six adjacent map cells.
There are several benefits with pointer structures. First of all, they don't require sequential storage space. Second, they can start small and grow arbitrarily as you add more nodes to the structure.
As noted in Chapter 2, Python Data Types and Structures, however, this comes at a cost. If you have a list of integers, each node is going to take up the space of an integer, as well as an additional integer for storing the pointer to the next node.
- Data Visualization with D3 4.x Cookbook(Second Edition)
- Delphi程序設計基礎:教程、實驗、習題
- Java從入門到精通(第5版)
- AIRAndroid應用開發實戰
- 64位匯編語言的編程藝術
- Android程序設計基礎
- Microsoft Azure Storage Essentials
- 移動互聯網軟件開發實驗指導
- Web App Testing Using Knockout.JS
- Natural Language Processing with Python Quick Start Guide
- Python第三方庫開發應用實戰
- Learning WordPress REST API
- Android應用程序設計
- Socket.IO Cookbook
- 菜鳥成長之路