Answer Posted / mahesh m

#include<stdio.h>
int main()
{
int i,j,n=5,a;
for (i=1;i<5;i++)
{
for(j=1;j<=n;j++)
{
printf("%d",j);
a=j;
}
for(int k=1;k<=n;k++)
{
printf("%d",a);
a--;
}
n=n-1;
}
}

Prepare me a program for the animation of train

2417

---

What is polymorphism and why is it important?

987

---

Get me a number puzzle game-program

2186

---

What are different types of JVM's? for example we use dalvik jvm for android then what about the remaining operating systems?

2086

---

What is object and class in oops?

1009

---

what are the realtime excercises in C++?

2792

---

What is abstract class in oop?

957

---

Can we override main method?

1132

---

What is coupling in oops?

1071

---

How do you use inheritance in unity?

1027

---

What is abstract class in oops?

976

---

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

3705

---

Can a varargs method be overloaded?

1044

---

What is overriding vs overloading?

1012

---

Why is polymorphism needed?

1007

---