官术网_书友最值得收藏!

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.

主站蜘蛛池模板: 西峡县| 吴桥县| 德阳市| 大悟县| 清新县| 雅江县| 都匀市| 视频| 大渡口区| 潮安县| 溧阳市| 余干县| 永清县| 沅陵县| 盐山县| 章丘市| 屏边| 疏勒县| 博爱县| 宁晋县| 余干县| 靖西县| 安陆市| 丹巴县| 惠水县| 疏勒县| 包头市| 微山县| 团风县| 中江县| 大宁县| 登封市| 河源市| 和政县| 安泽县| 广宗县| 和平区| 邳州市| 荣昌县| 遂川县| 密山市|