Answer Posted / hbp sandeep

Procedure Oriented Language: It follows the a procedure
that is simply saying it will go line by line in the code
unless if u mentioned any goto are any code breaking
keywords.

Object Oriented Language: In this each and every program is
called as Object. that is simply saying we will breake the
code in to small pieces and we will call the code when we
want.

What is pointer in oop?

981

---

What is polymorphism and example?

996

---

#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.

3715

---

What are the features of oop?

1110

---

What is a class and object?

1018

---

write a program to find 2^n+1 ?

2029

---

write a program to find 2 power of a 5digit number with out using big int and exponent ?

2341

---

How is class defined?

1078

---

How do you achieve polymorphism?

1043

---

Why is static class not inherited?

1059

---

What is methods in oop?

933

---

What does I oop mean?

1029

---

What is polymorphism used for?

1024

---

class type to basic type conversion

2348

---

What is super in oop?

1104

---