Question

C++ Programming By using Binary heap

Develop a CPP program to test is an array conforms heap ordered binary tree. This program read data from cin (console) and gives an error if the last item entered violates the heap condition. Use will enter at most 7 numbers. Example runs and comments (after // ) are below. Your program does not print any comments. An output similar to Exp-3 and Exp-4 is expected.

Exp-1:

Enter a number: 65   // this is first item (root,[1]) in the heap three. it does not violate any other item. So, no violation hereEnter a number: 55  // this is second [2] number, should be less than or equal to its root ([1])
Enter a number: 56  // this is third [3] number, should be less than or equal to its  root ([1])
Enter a number: 45  // this is fourth number, should be less than or equal to its root ([2])
Enter a number: 61  // this is fifth number, should be less than or equal to its root ([2]). It is not, 61 > 55. Then give an error and exit
61 violated the heap. Bye..

Exp-2:

Enter a number: 100   
Enter a number: 95  // 95 < 100, OK
Enter a number: 76  // 76 < 100, OK
Enter a number: 58  // 58 < 95, OK
Enter a number: 66  // 66 < 95, OK
Enter a number: 58  // 58 < 76, OK
Enter a number: 66  // 66 < 76, OK
All good. Bye

Exp-3:

Enter a number: -15   
Enter a number: -5  
-5 violated the heap. Bye..

Exp-4:

Enter a number: 45   
Enter a number: 0  
Enter a number: 55  
55 violated the heap. Bye..

Answer 1

Code:-

#include<iostream>
using namespace std;
int main()
{
   int i,arr[7],k=0,l=1,j;
   /* here atmost 7 entries are considered as per question */
   int n=7;
   /* loop for 7 times of 7 entries */
   for(i=0;i<n;i++)
   {
       /* console input of number */
       cout<<"Enter a number : ";
       /* insert number in array */
       cin>>arr[i];
       if(l<=2 && i>0)
       {
           k++;
        }
       if(l>2 && i>0)
       {
           l=l-2;
       }
       /* index of the root of sub trees' */
       j=i-k;
       /* if it supports heap condition
       means i th element will be greater than 2*i+1 and 2*i+2 th element */
       if(i>0 && arr[j]>arr[i])
       {
       l++;
       }
       /*if it violate heap rule means i th element will be smaller than 2*i+1 or 2*i+2 th element */
       if(i>0 && arr[j]<arr[i])
       {
           /* print message and break loop */
           cout<<endl<<arr[i]<<" violate the heap. Bye..";
           break;
       }
   }
   /* if i is 7 means full loop run, so it does not violate heap rule */
   if(i==7)
   {
       cout<<endl<<"All good. Bye";
   }
   return 0;
}

Code Screenshot:-

#include<iostream> using namespace std; int main() int i, arr[7], k=0,1=1,j; /* here atmost 7 entries are considered as per question */ int n=7; /* Loop for 7 times of 7 entries */ for(i=0;i<n;i++) 1 2 3 40 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 6 /* console input of number */ cout<<"Enter a number : "; /* insert number in array */ cin>>arr[i]; if(l<=2 && i>e) k++; if(1>2 && i>) 22 23 24 25 1=1-2; } /* index of the root of sub trees' */ j-i-k; /* if it supports heap condition means i th element will be greater than 2*i+1 and 2*i+2 th element */ if(i> && arr[j]>arr[i]) { 1++; } /*if it violate heap rule means i th element will be smaller than 2*i+1 or 2*i+2 th element */ if(i> && arr[j]<arr[i]) 27 28 - /* print message and break Loop */ cout<<endl<<arr[i]<<" violate the heap. Bye.."; break; } 30 31 32 33 A 34 35 36 37 38 39 40 41 42 43 44 45 /* if i is 7 means full Loop run, so it does not violate heap rule */ if(i==7) cout<<endl<<"All good. Bye"; return;

Outputs:-

C:\Users\Siva Kumar\Desktop\1.exe Enter a number : 65 Enter a number : 56 Enter a number : 45 Enter a number : 61 61 violate the heap. Bye.. Process exited after 11.27 seconds with return value o Press any key to continue .

C:\Users\Siva Kumar\Desktop\1.exe Enter a number : 100 Enter a number : 95 Enter a number : 76 Enter a number : 58 Enter a number : 66 Enter a number : 58 Enter a number : 66 All good. Bye Process exited after 19.42 seconds with return value o Press any key to continue.

C:\Users\Siva Kumar\Desktop\1.exe Enter a number : -15 Enter a number : -5 -5 violate the heap. Bye.. Process exited after 13.2 seconds with return value o Press any key to continue .

C:\Users\Siva Kumar\Desktop\1.exe Enter a number : 45 Enter a number : 0 Enter a number : 55 55 violate the heap. Bye.. Process exited after 11.48 seconds with return value o Press any key to continue

Please UPVOTE thank you...!!!