Q1. What type of data structure is used to store a group of elements in a non-linear manner?
Explanation
A tree is a non-linear data structure because its elements are arranged hierarchically as nodes and branches rather than in one straight sequence. That is why it fits the phrase 'non-linear manner'. A queue is linear and follows first-in, first-out order. An array is also linear because elements are stored in indexed positions in a sequence. A stack is linear as well and follows last-in, first-out order. Among the given choices, only a tree represents a non-linear arrangement.
