Question:
Which of the following is not a non linear data structure ?
Which of the following is not a non linear data structure ?
Show Hint
Non-linear = Branching (Trees, Graphs). Linear = Straight line (Arrays, Lists).
Updated On: Aug 6, 2026
- Binary tree
- Heap
- Graph
- char
Show Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
Concept:
• Data structures are classified based on how data elements are organized.
• Linear Data Structures: Elements are arranged in a sequence (e.g., Array, Stack, Queue, Linked List).
• Non-Linear Data Structures: Elements are not arranged in a sequence; they form hierarchical or interconnected relationships (e.g., Trees, Graphs).
Step 1: Identify the non-linear structures among the options
• Binary Tree (Option A): A hierarchical structure where each node has at most two children. Clearly non-linear.
• Heap (Option B): A specialized tree-based data structure (often represented in an array, but logically a complete binary tree). Non-linear.
• Graph (Option C): A set of vertices connected by edges in a non-sequential web. Non-linear.
Step 2: Analyze the "char" data type
A "char" (character) is a basic data type in programming. While it is not a "structure" in the same way a tree is, it represents a single scalar value. If we consider it in the context of data organization, characters are treated linearly (like in a string/array). More importantly, it definitely does not possess the hierarchical or networked properties required for a non-linear classification.
Step 3: Final conclusion
Since the question asks for what is not non-linear, "char" is the only correct fit as it is a primitive/scalar type, and the others are explicitly non-linear structures.
• Data structures are classified based on how data elements are organized.
• Linear Data Structures: Elements are arranged in a sequence (e.g., Array, Stack, Queue, Linked List).
• Non-Linear Data Structures: Elements are not arranged in a sequence; they form hierarchical or interconnected relationships (e.g., Trees, Graphs).
Step 1: Identify the non-linear structures among the options
• Binary Tree (Option A): A hierarchical structure where each node has at most two children. Clearly non-linear.
• Heap (Option B): A specialized tree-based data structure (often represented in an array, but logically a complete binary tree). Non-linear.
• Graph (Option C): A set of vertices connected by edges in a non-sequential web. Non-linear.
Step 2: Analyze the "char" data type
A "char" (character) is a basic data type in programming. While it is not a "structure" in the same way a tree is, it represents a single scalar value. If we consider it in the context of data organization, characters are treated linearly (like in a string/array). More importantly, it definitely does not possess the hierarchical or networked properties required for a non-linear classification.
Step 3: Final conclusion
Since the question asks for what is not non-linear, "char" is the only correct fit as it is a primitive/scalar type, and the others are explicitly non-linear structures.
Was this answer helpful?
0
0
Top CUET PG Data Science A.I Cyber Security and Computer Sci. Questions
- Choose the correct answer from the options given below:
(A). RAID 3 requires only a single redundant disk.
(B) In RAID 4 scheme, two different parity calculations are carried out and stored in separate blocks on different disks.
(C) RAID 5 distributes the parity strips across all disks.
(D) In RAID 2, the number of redundant disks are proportional to the log of the number of data disks. - In case of DMA, after the completion of the transfer, the processor is required to be notified of the completion. This is done through.
- In a two-level memory hierarchy, the access time of the cache memory is 12 nsec and the access time of the main memory is 1.5 msec. The hit ratio is 0.98. What is the average access time of the two-level memory system?
- Match List I with List II.
List I List II A. Supervisor mode I. Entered when the processor encounters a software interrupt instruction B. Abort Mode II. Entered in response to memory fault C. Fast Interrupt Mode III. Entered whenever the processor receives an interrupt signal from a designated fast interrupt source D. Interrupt Mode IV. Entered whenever the processor receives an interrupt signal from any other source - Deallocation of stack of thread and register contexts will take place.
View More Questions
Top CUET PG Programming and Data Structures Questions
- A hash function f defined as f(key) = key mod 7, with linear probing, is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6. What will be the location of key 11?
- The worst-case time complexity of inserting a node in a doubly linked list is:
- Consider the given two statements:
S1: Kruskal’s Algorithm might produce a non-minimal spanning tree.
S2: Kruskal’s Algorithm can be efficiently implemented using the disjoint set data structure.
Choose the correct answer from the options given below: - Match List I with List IIChoose the correct answer from the options given below:
LIST I LIST II (A) Circular Linked List (I) Recursive Function Calls (B) Doubly Linked List (II) Round Robin Queue in CPU (C) Stack (III) Hash Tables (D) Singly Linked List (IV) Undo and Redo Functionality - Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?
(A) 2
(B) 3
(C) 1
(D) 4
(E) 5
Choose the correct answer from the options given below:
View More Questions
Top CUET PG Questions
- Given below are two statements:
Statement I: For Plato the meaning of the word 'Justice' is basically a conception in the mind only.
Statement II: For Plato the meaning of the word 'Justice' is fixed, mind-independently
In the light of the above statements, choose the correct answer from the options given below: - What is the electron count of OS6CO182-?
- XeF4 hydrolysis gives A + B, HF, and Oxygen. Find A and B
- What is more basic in pyrol and pyridine?
- Hydrolysis of Al2C3, Be2?
View More Questions