The data structure that best supports indirect addressing mode is the linked list. In a linked list, each element (or node) contains a reference (or pointer) to the next element, allowing for dynamic memory allocation and easy traversal. This structure is particularly effective for indirect addressing because it enables the ability to access elements without needing to know their physical memory addresses directly. Additionally, it allows for efficient insertions and deletions, which are beneficial in scenariOS where the data size can change frequently.
Copyright © 2026 eLLeNow.com All Rights Reserved.