Data Structure Quiz (Set 2) Data Structures (Set 2) 1 / 10 What is a 'binary search'? A search algorithm used to find an element in an unsorted array A search algorithm used to find an element in a sorted array by repeatedly dividing the search interval in half A search algorithm used to find the smallest element in an array A search algorithm used to find an element in a linked list 2 / 10 Explain the concept of 'graph traversal'. Graph traversal refers to the process of deleting nodes from a graph Graph traversal refers to the process of connecting nodes in a graph Graph traversal refers to the process of visiting and exploring all nodes in a graph Graph traversal refers to the process of storing nodes in a graph 3 / 10 What is the 'in-order traversal' of a binary tree? A traversal where nodes are visited level by level, from left to right A traversal where nodes are visited from the root node to leaf nodes, following left, root, right order A traversal where nodes are visited from leaf nodes to the root node A traversal that visits nodes in random order 4 / 10 Explain the concept of 'balanced binary trees'. Balanced binary trees are trees where each node has exactly two children Balanced binary trees are trees where the height difference between the left and right subtrees of any node is minimized Balanced binary trees are trees where nodes are connected in a linear manner Balanced binary trees are trees where each node is connected to all other nodes 5 / 10 What is the purpose of 'hash collision' handling in hash tables? To rearrange the elements in the hash table to reduce collisions To prevent hash functions from generating the same hash for different keys To resolve situations where two different keys generate the same hash value To increase the size of the hash table to reduce collisions 6 / 10 What is a 'heap' in data structures? A data structure that stores elements in non-contiguous memory locations A binary tree that satisfies the heap property, where the parent node is smaller (or larger) than its child nodes A linear data structure that follows the Last In First Out (LIFO) principle A non-linear data structure used to store key-value pairs 7 / 10 Breadth First search is used in Binary trees Stacks Graphs Both a and c 8 / 10 A tree cannot contain cycles. False True 9 / 10 Items in a priority queue are entered in a _____________ order random order of priority as and when they come none of the above 10 / 10 Which of the following linked list below have last node of the list pointing to the first node? circular doubly linked list circular linked list circular singly linked list doubly linked list Your score isThe average score is 0% 0% Restart quiz