Pretend you are a teacher preparing a quiz for the text I will provide. 
            Each quiz question should follow the format below. 
            Ensure that you carefully recheck the questions and answers for accuracy. 
            The output should be a ready-to-use list of dictionaries for the Python eval function:

            [

                    "question": "WRITE THE QUESTION HERE",
                    "options": ["A) OPTION_1", "B) OPTION_2", "C) OPTION_3", "D) OPTION_4"],
                    "answer": INDEX_OF_CORRECT_ANSWER_IN_OPTIONS_LIST,
                    "explanation": "EXPLAIN WHY THE ANSWER IS CORRECT"

            ]

            Text:
            ee whose left subtree and right subtree differ in hight by at most 
1 unit is called ..... 
[A] Lemma tree 
[B] Redblack tree 
[C] AVL tree 
[D] None of the above 
Answer c 
 
62 Which of the following is non-linear data structure? 
[A] Trees 
[B] Stacks 
[C] Strings 
[D] All of the above 
 
Answer: a 
 
63 The number of comparisons done by sequential search is ....... 
[A] (N/2)+1 
[B] (N+1)/2 
[C] (N-1)/2 
[D] (N-2)/2 
Answer: Option [B] 
 
64 .... is not the operation that can be performed on queue. 
[A] Traversal 
[B] Insertion 
[C] Deletion 
[D] Retrieval 
Answer: Option [A] 
 
65 Which is/are the application(s) of stack 
[A] Function calls 
[B] Large number Arithmetic 
[C] Evaluation of arithmetic expressions 
[D] All of the above 
Answer: Option [D] 
 
66 Which of the following data structures are indexed structures? 
[A] Stack 
[B] Linked lists 
[C] Linear arrays 
[D] None of the above 
Answer: Option [C] 
 
67Which of the following data structure store the homogeneous data elements? 
[A] Lists 
[B] Pointers 
[C] Records 
[D] Arrays 
Answer: Option [C] 
 
68 Linear arrays are also called....... 
[A] One-dimensional array 
[B] Vertical array 
[C] Horizontal array 
[D] All of the above 
Answer: Option [A] 
 
69 A ......... does not keep track of address of every element in the list. 
[A] Stack 
[B] Queue 
[C] String 
[D] Linear array 
 
Answer: Option [D] 
 
70 The complexity of linear search algorithm is 
[A] O(n) 
[B] O(log n) 
[C] O(n2) 
[D] O(n log n) 
Answer: Option [A] 
 
71 The complexity of Binary search algorithm is 
[A] O(n) 
[B] O(log n) 
[C] O(n2) 
[D] O(n log n) 
Answer: Option [B] 
 
72Linear arrays are also called....... 
[A] One-dimensional array 
[B] Vertical array 
[C] Horizontal array 
[D] All of the above 
Answer: Option [A] 
 
73Can linked list be implemented using arrays? 
A. 
Yes 
B. 
No 
Ans: A 
 
74 Two dimensional arrays are also called 
A. tables arrays 
B. matrix arrays 
C. both of above 
D. none of above 
Ans: C 
 
75 Can stack be described as a pointer? 
A. 
Yes 
B. 
No 
Ans: A 
 
76 Which of the following linked list below have last node of the list pointing to the 
first node? 
A. 
circular doubly linked list 
B. 
circular linked list 
C. 
circular singly linked list 
D. 
doubly linked list 
Ans: A 
 
77 Items in a priority queue are entered in a _____________ order 
A. 
random 
B. 
order of priority 
C. 
as and when they come 
D. 
none of the above 
Ans: A 
 
78An empty list is the one which has no 
A. 
nodes 
B. 
data 
C. 
both a and b above 
D. 
address 
Ans: C 
 
79. Which data structure allows deleting data elements from front and inserting at 
rear? 
a. Stacks 
b. Queues 
c. Deques 
d. Binary search tree 
ans:b 
 
80 Identify the data structure which allows deletions at both ends of the list but 
insertion at only one end. 
a. Input-restricted deque 
b. Output-restricted deque 
c. Priority queues 
d. None of above 
ans:a 
 
81 Which of the following data structure is non-linear type? 
a. Strings 
b. Lis

            Quiz: