Why is not creat swap partition in my system.

1824

What is app.iml/ directory?

986

Explain on which technology does xws security is based on?

754

What is the use of dynamic match type?

389

How do I join one form to another in c#?

979

What criteria should we use to evaluate an sem vendor?

930

How to generate it on homestead?

852

Explain different types of segment?

1089

What resistance the ship encounter when the vessel is at sea

2110

What is fo file format?

900

How Many Computers Can Share a WiFi Network?

1500

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

3830

Do you know what is lambda in python?

1089

Explain me what the difference is between false and nil in ruby?

1

What's the difference between impact sockets and regular sockets?

904