(A) 7 3 6 4 2 5 1
(B) 7 6 4 3 5 2 1
(C) 7 3 6 2 1 4 5
(D) 7 6 5 4 3 2 1
Category: Data Structures Mcqs
Data Structures Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Data Structures Mcqs section will help users to prepare mcqs of Data Structures for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Data Structures portion from here.
Select the one false statement about binary trees:
(A) Every binary tree has at least one node
(B) Every non-empty tree has exactly one root node
(C) Every node has at most two children
(D) Every non-root node has exactly one parent
Searching an element in an AVL tree take maximum __ time (where n is no. of nodes in AVL tree).
(A) 1.44 Log2n
(B) 1.66 Log2n
(C) Log2(n+1)
(D) Log2(n+1) -1
__ only removes items in reverse order as they were entered.
(A) Stack
(B) Queue
(C) Both of the above
(D) None of the above
We are given N items to build a heap, this can be done with __ successive inserts.
(A) N-1
(B) N
(C) N+1
(D) N2
Which one of the following algorithms is most widely used due to its good average time?
(A) Bubble sort
(B) Insertion sort
(C) Quick sort
(D) Merge sort
A complete binary tree of height 3 has between __ nodes.
(A) 8 to 14
(B) 8 to 15
(C) 8 to 16
(D) 8 to 17
Which of the following method is helpful in creating the heap at once?
(A) Insert
(B) Add
(C) Update
(D) preculateDown