Data Structure Heap Online Exam Quiz
Data Structure Heap GK Quiz. Question and Answers related to Data Structure Heap. MCQ (Multiple Choice Questions with answers about Data Structure Heap
In a max-heap, element with the greatest key is always in the which node?
Options
A : Leaf node
B : First node of left sub tree
C : root node
D : First node of right sub tree
What is the complexity of adding an element to the heap.
Options
A : O(log n)
B : O(h)
C : O(log n) & O(h)
D : O(n)
The worst case complexity of deleting any arbitrary node value element from heap is __________
Options
A : O(logn)
B : O(n)
C : O(nlogn)
D : O(n2)
An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
Options
A : O(n*n*logn)
B : O(n*logn)
C : O(n*n)
D : O(n *logn *logn)
Heap can be used as ________________
Options
A : Priority queue
B : Stack
C : A decreasing order array
D : Normal Array
Heap exhibits the property of a binary tree?
Options
A : True
B : False
C :
D :
Data Structure Adjacency List more Online Exam Quiz
Data Structure Generating Combinations
Data Structure Generating Partitions
Data Structure Generating Subsets
Data Structure Incidence Matrix Graph Structured Stack
Data Structure Inorder Traversal