Answer Posted / qapoo

int main()
{
int a[5]={1,2,2,3,3};
for(int i=0;i<5;i++)
{
if(a[i]<a[i+1])
cout<<a[i];
}
return 0;
}

What is abstraction encapsulation?

1059

---

What is byval and byref? What are differences between them?

2149

---

What is encapsulation in oops?

958

---

What is the importance of oop?

1038

---

What is difference between oop and pop?

1102

---

What is polymorphism explain its types?

1099

---

how to get the oracle certification? send me the answer

2100

---

Write a c++ program to display pass and fail for three student using static member function

3326

---

Can we create object of interface?

1064

---

What is the real time example of encapsulation?

1007

---

What is difference between multiple inheritance and multilevel inheritance?

1103

---

Why is object oriented programming so hard?

1025

---

State what is encapsulation and friend function?

1190

---

How to hide the base class functionality in Inheritance?

1089

---

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

3700

---