what is new operator in c++

1 Answers  

---

What is interface in oop?

0 Answers  

---

What is the point of polymorphism?

0 Answers  

---

Whatis the difference between oop and object based language

3 Answers  

---

How to reverse a sentence in c program ex: ram is a good boy answer: boy good a is ram

0 Answers   IBM,

---

What is polymorphism in oops?

1 Answers  

---

What is the difference between and interface and an abstract class ?

4 Answers   IBM, Infosys, Ness Technologies,

---

Define a class to represent a bank account. Include the following members: Data Members: Name of the Depositor Account Number Type of Account Balance amount in the account Member Functions: To assign the initial values. To deposit an account. To withdraw an amount after checking the balance. Write a C++ main program to display account number, name and balance.

6 Answers  

---

What is inheritance and how many types of inheritance?

0 Answers  

---

how many types of notations are in java

1 Answers   National University of Modern Languages (NUML),

---

What is data binding in oops?

0 Answers  

---

#include <stdio.h> #include <alloc.h> #include <stdlib.h> #include <conio.h> 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.

0 Answers  

---