If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100)is chosen to replace the root at start.(a) 2(b) 100(c) 17(d) 3Query is from Heap in section Heap of Data Structures & Algorithms IThis question was addressed to me in examination.

If we implement heap as min-heap, deleting root node (value 1)from the

1.	If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100)is chosen to replace the root at start.(a) 2(b) 100(c) 17(d) 3Query is from Heap in section Heap of Data Structures & Algorithms IThis question was addressed to me in examination.
Answer» The correct choice is (a) 2 The explanation is: As the ROOT is deleted and NODE with value 100 is used as replaced one. There is a violation of property that root node must have value less than its children. So there will be shuffling of node with value 100 with node of value 2. And thus 2 becomes root. And it will remain to be at root after all the POSSIBLE OPERATIONS. So the value at root will be 2.

Discussion

No Comment Found

Related InterviewSolutions

What is the fundamental operation performed in skew heaps?(a) intersection(b) difference(c) merging(d) sortingThis interesting question is from Heap in section Heap of Data Structures & Algorithms II have been asked this question during an online interview.
What is the time per operation of merging, insertion and deletion operations in a skew heap?(a) O(N)(b) O(log N)(c) O(N log N)(d) O(N^2)I need to ask this question from Heap topic in division Heap of Data Structures & Algorithms IThis question was posed to me during an interview.
Why would a recursive implementation fail in skew heaps?(a) skew heaps are self adjusting(b) efficiency gets reduced(c) lack of stack space(d) time complexityMy query is from Heap topic in portion Heap of Data Structures & Algorithms IThe question was posed to me in class test.
Which of the following is difficult to determine the right path length?(a) Skew heaps(b) Binomial tree(c) Leftist heap(d) d-heapI need to ask this question from Heap topic in division Heap of Data Structures & Algorithms II got this question in class test.
The worst case analysis for a naïve merge is given as?(a) O(N)(b) O( log N)(c) O( N log N)(d) O(N^2)This interesting question is from Heap in portion Heap of Data Structures & Algorithms IThe question was posed to me during an online interview.
How many types of the merge are available in skew heaps?(a) 1(b) 2(c) 3(d) 4I want to ask this question from Heap topic in chapter Heap of Data Structures & Algorithms IThis question was posed to me in my homework.
What is the amortized efficiency of skew merge?(a) O(N)(b) O( log N)(c) O( N log N)(d) O(N^2)Question is from Heap in chapter Heap of Data Structures & Algorithms IThis question was posed to me during an interview for a job.
In skew heaps, certain constraints are to be met in order to perform swapping.(a) true(b) falseThis question is from Heap in section Heap of Data Structures & Algorithms II have been asked this question during an interview.
Descending priority queue can be implemented using ______(a) max heap(b) min heap(c) min-max heap(d) trieMy question is based upon Heap topic in section Heap of Data Structures & Algorithms II had been asked this question during an interview for a job.
Min heap can be used to implement selection sort.(a) True(b) FalseThis key question is from Heap topic in chapter Heap of Data Structures & Algorithms IThis question was posed to me during an internship interview.

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment