SUBJECT: DATA STRUCTURES AND ALGORITHM

NOTE: Please Use Simple Coding, Not Too Complexed, Please do write the code in Dev C++ Compiler.(IF CODE REQUIRED)

LAST 2 DIGITS OF AIRD NO ASKED IN QUESTION:1,2

4 5 6 7 8 9 10 11 0 1 2 3 A: 1 12 23 10 15 38 45 15 18 20 21 0 ! 2 4 7 8 9 10 11 Q.No.3 a) Which array out of A, B and C represents a binary heap? Only one answer is right. b) Write the heap out as a binary tree. c) Add last 2 digit of your arid no. to the heap. making sure to restore the heap invariant. How does the array look now? B = 18 27 10 45 83 91 31 12 52 51 0 1 2 3 4 5 6 7 8 9 10 11 C: 1 13 20 21 65 5467 41 30 83 52 Ans. Q.No.3