EDUCATION UGC NET
ICT
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
Stack
|
|
Array
|
|
Queue
|
|
Binary Tree
|
Detailed explanation-1: -Arrays, linked list, stack, queue are the types of a linear data structure. Trees and graphs are the types of a non-linear data structure.
Detailed explanation-2: -A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node.
Detailed explanation-3: -A tree data structure is non-linear because it does not store sequentially. It is a hierarchical structure as elements in a Tree are arranged in multiple levels. The topmost node in the Tree data structure is known as a root node. Each node contains some data, and data can be of any type.
Detailed explanation-4: -Stacks, Queues, Arrays, and Linked lists are all examples of linear data structures.
Detailed explanation-5: -A binary tree is a non-linear data structure comprising nodes, and each parent has a maximum of two children. Each node in the tree contains the data element, the pointer to the left child, and a pointer to the right child.