Write an algorithm that determines whether or not an almost
complete binary tree is a heap.



No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C++ General Interview Questions

Consider the following code fragment: int main(void) { int m = 4; mystery ( m ); mystery ( m ); printf("%d", m); return 0; } What is the output on the monitor if mystery is defined as follows ? void mystery (int m) { m = m+3; }

2 Answers   CDAC, Wipro,


given the code segment below void main() { cout<<"my no. is"; } question is how can we get the output hai aravind my no. is 99999999999 without editig the main().

2 Answers  


Write a program to encrypt the data in a way that inputs a four digit number and replace each digit by (the sum of that digit plus 7) modulus 10. Then sweep the first digit with the third, second digit with the fourth and print the encrypted number.

0 Answers   CIIT Wah,


How would you use the functions sin(), pow(), sqrt()?

0 Answers  


How to change constant values?

6 Answers   Huawei, Symphony,






catch(exception &e) { . . . } Referring to the sample code above, which one of the following lines of code produces a written description of the type of exception that "e" refers to? a) cout << e.type(); b) cout << e.name(); c) cout << typeid(e).name(); d) cout << e.what(); e) cout << e;

2 Answers   Quark,


What is an accessor in c++?

0 Answers  


What happens if an exception is throws from an object's constructor and from object's destructor?

3 Answers   TCS,


What is the best free c++ compiler for windows?

0 Answers  


How does java differ from c and c++?

0 Answers  


Is c++ still in demand?

0 Answers  


Which operator can not be overloaded in C++?

1 Answers  


Categories