Multiple choice technology architecture

To represent hierarchical relationship between elements, which data structure is suitable?

  1. Deque

  2. Priority

  3. Tree

  4. All of above
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Trees are the standard data structure for representing hierarchical relationships because each node can have multiple children, forming a parent-child hierarchy. Deques (double-ended queues) are linear structures for adding/removing from both ends, not hierarchies. Priority queues are for ordered access by priority, not hierarchy. Option C is correct.

Keep practicing — related questions