+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the fundamental operation on leftist heap?

(a) insertion

(b) merging

(c) deletion

(d) swapping

My question is taken from Heap topic in section Heap of Data Structures & Algorithms I

This question was addressed to me in a job interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct option is (b) merging

The explanation is: The fundamental operations on leftist heaps is merge. Insertion operation is a merge of a one-node heap with a larger heap.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...