You Must Thinkof ...

/*   These are  c++ code on Trees All codes are commented to view the output of code uncomment it and comment all other codes to see it's output.  */ #include<bits/stdc++.h> using namespace std; //code 1 /*int main() {     int n,i;     cin>>n;     int a[n+1];     for(i=0;i<n;i++)     {         cin>>a[i];     }     bool flag=true;     for(i=0;i<(n/2)-1;i++)     {         if(a[i]<a[(2*i)+1] || a[i]<a[2*i+2])         {             flag=false;             break;         }     }     if(flag==true)     {         cout<<"it is max heap"<<endl;     }     else     {         cout...

Quant : 1.  Percentage 2.  Simple and compound interest 3.  Profit Loss And Discount 4.  Ratio And Proportion 5.  Average And Ages 6. Time Distance Speed 7. Algebra 8. Number System Basic, Cylictic 9. Mixture And Solution 10. Number System Factor And Factorial 11. Permutation And Combination 12. Probability 13. Time Work Wages 14. Gemotry Verbal 1. Article 2. Noun 3. Pronoun 4. Preposition 5. Synonyms 6. Antonym 7. One Word Substitution 8. Subject-Verb Agreement 9. Para Jumbles Reasoning 1.  Syllogism 2.  Logical Vein Diagram 3.  Direction Sense Test 4. Alphanumeric Symbol 5. Sequence 6. Coding And Decoding 7. Odd One Out 8. Analogy 9. Blood Relation 10. Seating Arrangement