Which of the following is an example of a non-linear data structure?

Options

  • A. Stack
  • B. Queue
  • C. Tree
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

C. Tree

Detailed Explanation

A Tree is a non-linear data structure because one node can be connected to multiple other nodes, forming a hierarchical relationship. Common tree terminology includes root, parent, child, leaf, sibling, depth, height, and subtree. Unlike arrays, stacks, queues, and linked lists, tree elements are not arranged in a single sequential path. Examples include binary trees, binary search trees, heaps, and B-trees.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts