What are Apache Spark, Flume, Lucene, Hama, HCatalog, Mahout, Drill, Crunch and Thrift?

582

What are the functions of NABARD?

1064

Examples of situations when your initiative ideas.

1060

Is c++ a low level language?

926

What is the default bean scope within spring?

408

How are the structural profiles maintained?

921

What is php artisan serve?

932

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

3711

Depresation Rates as per Income Tax Law ?

2406

How recorded command can be edited in ide?

895

What is difference between ioc and dependency injection?

413

Explain the advantages of packages in java?

867

What is stored procedure. How do you create stored procedure ?

1903

What do you mean by the depreciation?

1164

What is the use of 'ne' operator?

939