Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
You are given a Heap A[1, ..., n]. Describe an algorithm to delete an element at index 'k' (1 <= k <= n) in this Hea Your algorithm should return a Heap A[1, ..., n-1]. You can assume that FixHeap is already available to you and can simply refer/call it as appropriate. Write proper pseudocode in other cases. Hint: This is very similar to the home work problem where you changed the value of an element at index 'k' in a Heap. Here, the value of the element at index 'k' should be changed (to what?)!

You are given a Heap A[1, ..., n]. Describe an algorithm to delete an element at index 'k' (1 <= k <= n) in this Hea Your algorithm should return a Heap A[1, ..., n-1]. You can assume that FixHeap is already available to you and can simply refer/call it as appropriate. Write proper pseudocode in other cases. Hint: This is very similar to the home work problem where you changed the value of an element at index 'k' in a Heap. Here, the value of the element at index 'k' should be changed (to what?)!

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
You are given a Heap A[1, ..., n]. Describe an algorithm to delete an element at index 'k' (1 <= k <= n) in this Hea Your algorithm should return a Heap A[1, ..., n-1]. You can assume that FixHeap is already available to you and can simply refer/call it as appropriate. Write proper pseudocode in other cases. Hint: This is very similar to the home work problem where you changed the value of an element at index 'k' in a Heap. Here, the value of the element at index 'k' should be changed (to what?)!
Transcribed Image Text:You are given a Heap A[1, ..., n]. Describe an algorithm to delete an element at index 'k' (1 <= k <= n) in this Hea Your algorithm should return a Heap A[1, ..., n-1]. You can assume that FixHeap is already available to you and can simply refer/call it as appropriate. Write proper pseudocode in other cases. Hint: This is very similar to the home work problem where you changed the value of an element at index 'k' in a Heap. Here, the value of the element at index 'k' should be changed (to what?)!
Expert Solution
Step 1

Deletion of Element from any intermediary position is costly.so, it is suggested to replace the element that one wants to be deleted with the last node and then delete the last node of heap.

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS