Answer Posted / chinna

Run Time Type Information ( RTTI ) : Run-time type
information (RTTI) is a mechanism that allows the type of
an object to be determined during program execution.

There are three main C++ language elements to run-
time type information:
The dynamic_cast operator : Used for conversion of
polymorphic types.

The typeid operator : Used for identifying
the exact type of an object.
The type_info class : Used to hold the type information
returned by the typeid operator.

what type of question are asked in thoughtworks pair programming round ?

2148

---

Can we create object of interface?

1069

---

write a program that takes input in digits and display the result in words from 1 to 1000

2372

---

what type of questions

2068

---

How oops is better than procedural?

1031

---

Explain the concepts involved in Object Oriented programming.

1146

---

What makes a language oop?

1009

---

What are different oops concepts?

1004

---

What is oops concept with example?

971

---

Why polymorphism is used in oops?

998

---

write a programe to calculate the simple intrest and compund intrest using by function overlading

2133

---

How to hide the base class functionality in Inheritance?

1093

---

What is encapsulation in oops?

960

---

#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

3702

---

what is the sylabus for priliminaries?

2126

---