Question:
Which one of the following is NOT a linear data structure?
Which one of the following is NOT a linear data structure?
Show Hint
The easiest way to identify a linear data structure is to see if you can naturally arrange its elements in a single line or sequence. Arrays, linked lists, stacks, and queues fit this description. Trees and graphs do not.
Updated On: Jul 2, 2026
- Array
- Stack
- Queue
- Tree
Show Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
Data structures can be classified as linear or non-linear.
Linear Data Structures: Elements are arranged in a sequential or linear order. Each element has at most one predecessor and one successor.
(A) Array: Elements are stored in contiguous memory locations, forming a sequence. It is a linear structure. (B) Stack: A list of elements where insertion and deletion occur at one end. Logically, it's a linear sequence. (C) Queue: A list of elements where insertion occurs at one end and deletion at the other. Logically, it's a linear sequence.
Non-Linear Data Structures: Elements are not arranged sequentially. An element can be connected to multiple other elements.
(D) Tree: A hierarchical structure where elements (nodes) are connected in a parent-child relationship. A node can have multiple children, so the structure is non-linear. Graphs are another example of non-linear structures.
Therefore, a Tree is not a linear data structure.
Linear Data Structures: Elements are arranged in a sequential or linear order. Each element has at most one predecessor and one successor.
(A) Array: Elements are stored in contiguous memory locations, forming a sequence. It is a linear structure. (B) Stack: A list of elements where insertion and deletion occur at one end. Logically, it's a linear sequence. (C) Queue: A list of elements where insertion occurs at one end and deletion at the other. Logically, it's a linear sequence.
Non-Linear Data Structures: Elements are not arranged sequentially. An element can be connected to multiple other elements.
(D) Tree: A hierarchical structure where elements (nodes) are connected in a parent-child relationship. A node can have multiple children, so the structure is non-linear. Graphs are another example of non-linear structures.
Therefore, a Tree is not a linear data structure.
Was this answer helpful?
0
0
Top AP ECET CSE Computer Science and IT Engineering Questions
- Which of the following is a universal gate?
- Which of the following is NOT a combinational circuit?
- A demultiplexer is a device that
- Convert the binary number 110011 into its decimal equivalent.
- The number of select lines required for an 8-to-1 multiplexer is?
View More Questions
Top AP ECET CSE Data Structures and Algorithms Questions
- Which data structure uses the FIFO (First In, First Out) principle?
- What is the time complexity of Binary Search on a sorted array?
- Which operation in a queue removes an element?
- In Selection Sort, which element is selected at each step while sorting the elements in ascending order?
- What type of data structure is used in recursion?
View More Questions
Top AP ECET CSE Questions
- If the matrix A = \(\begin{bmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{bmatrix}\), then which of the following is true?
- If A = \(\begin{bmatrix} a & b \\ c & d \end{bmatrix}\) and the determinant of A is 5, then determinant of the matrix 2A is
- If the matrix A is of order 3x3 and the system of equations AX = B has a unique solution, what can be concluded about the determinant of A?
- If A = \(\begin{bmatrix} x & 3 \\ 2 & 4 \end{bmatrix}\) and A\(^{-1}\) = \(\begin{bmatrix} -2 & 1.5 \\ 1 & -0.5 \end{bmatrix}\), then the value of x is
- If A = \(\begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix}\) and B = \(\begin{bmatrix} 1 & 0 \\ 1 & 0 \end{bmatrix}\), then \((AB)^T =\)
View More Questions