Stack, Queue and Linked List can be implemented using —

Stack, Queue, and Linked List are abstract data types that require dynamic memory allocation and element ordering. Let's analyze each option: A. Numeric variable: Stores a single number. Cannot manage multiple elements or pointers. Not suitable. B. String variable: Stores a sequence of characters. Lacks dynamic memory management and pointer support. Not suitable. C. Logical function: Returns true/false. Does not store data or manage memory. Not suitable. D. Array: Provides indexed storage, supports dynamic allocation, and can simulate linked structures using indices. Suitable for implementing Stack, Queue, and Linked List. E. Character constant: Stores a single character. Static and cannot manage collections. Not suitable.