You are given a binary min heap of height p Let the minimum and maximum number of comparisons we might have to do when doing a delete min respectively are u and v. Then What will be the value of v-u?
minimum and maximum number of comparisons needed when deletion in Binary Min heap
256 views Asked by glam videos opera At
1
There are 1 answers
Related Questions in DATA-STRUCTURES
- Why is the runtime for this O(n)?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- What is the problem in my "sumAtBis" code?
- Asking code suggestions about data structure and algorithm
- What would be the most efficient way to store multiple sets of fixed arrays (std::vector)?
- About Suffix Trees features
- Getting wrong answer in Binary Search solution
- Are there techniques to mathematically compute the amount of searching in greedy graph searching?
- AVL tree Nth largest operation - How to have all my tests pass? JAVA
- Why does the map size change?
- Complexity in Union of disjointed sets with lists
- Hash collisions in Golang map resolving
- C++ ordered map optimized with index access
- How to sort this list of strings along with the strings and output the result as expected?
- Why deleting an element in a linkedlist costs O(1)
Related Questions in HEAP
- OneDrive API Upload Large File
- I found a working code to insert a node at a heap implemented in array in C++ and I wonder why does the code work despite incrementing the size array
- Efficient list sorting: Using heap instead of standard sorting is slower
- Implementing a max heap in python using heapq for a custom class object with custom comparators in Python?
- Sorting sums of two numbers in an effective way
- An algorithm to find the shortest path based on 2 criteria
- At which levels in a max-heap might the `k`-th largest element reside?
- Incorrect Result Order with PHP Heaps
- Efficient Implementation of Priority Queue with Constant-Time Extraction of the Minimum Element
- Why we should use sink to construct the heap in heapsort rather than swim?
- Why does my code generate the "Debug Assertion Failed! _CrtIsValidHeapPointer(block)" error?
- Sliding Window Median Two Heaps Method in Python, TLE Error
- How to properly prioritize priority queue heap in ascending order in C?
- Unsure of course content validity
- Transforming Heaps
Related Questions in MIN-HEAP
- Is there a Python method to check whether a binary tree is a min heap?
- min-heap order for the following
- Unexpected behaviour of self implemented priority queue using min heap
- minimum and maximum number of comparisons needed when deletion in Binary Min heap
- Finding the maximum and minimum value inside a "max-min" heap in constant time
- Want to understand why PriorityQueue.addAll method is not considering comparator
- Issues with insertion function for binary min-heap priority queue
- How to preorder traverse a min heap using array indexing
- Is finding the min/max of BST considered to be O(1) time?
- How can i fix my implementation a generic Decrease-Key method in a Min Heap in java?
- How to get the T value from std::cmp::Reverse::<T>
- How the head is getting populated in below code of merging k sorted lists with min heap
- What is the meaning of vector<Node<int>*>?
- Why it resulting a "list index out of range error" on this dijkstra algorithm
- min priority queue question. dequeue doesn't work. says undefined for priority
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Popular Tags
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
You really should try to answer your own question before you post it here. Think of how the heap works. I won't "give" you the answer, but perhaps I can help you understand how to approach finding the answer.
Insertion into a binary heap involves adding the item at the lowest level and then sifting it up to where it needs to go. If the tree has a height
h, how many levels must it move to get to the top? How many comparisons are required to move the item up one level?Deletion in the heap is just a little bit more involved:
If the tree has a height
h, how many levels must it move to get back to the leaf level? How many comparisons does it take to move one level?That breaks the problem down into simpler pieces so you can think about it more clearly. The answer to the first question (how many levels to move) should be evident if you have any idea of how the heap works. The answer to the second question (comparisons per level) should be be evident from the description of the algorithm (or from reading the code that implements it).