Question: Please show all work (: 6. Given a sequence of numbers: 19, 6, 8, 11, 4,5 a) Draw a binary max-heap (in a tree form)
Please show all work (:
6. Given a sequence of numbers: 19, 6, 8, 11, 4,5 a) Draw a binary max-heap (in a tree form) by inserting the above numbers reading them from left to right. Finally draw the array A. b) Show a tree that can be the result after the call to HEAP-EXTRACT-MAX(A) on the above heap c) Show a tree after another call to MAX-HEAP-INSERT(A,10)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
