What is hover color?

559

Why doesn't the java library use a randomized version of quicksort?

934

What is System.RunAs ()?

498

What is where clause and let clause?

88

How will you define public expenditure?

1030

Implement the following methods: retain, release, auto release in iOS operating system?

746

How will you open a file using node?

527

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

3702

What is orchestration?

188

Which provider is used to connect ms access, oracle, etc…?

946

What are the file storage options provided by oracle database for oracle rac?

1

Can we use "this" command within a static method?

921

how to run the servlet in tomcat

2058

hai, i completed my B.Tech.i planning to join in testing tools.can anybody suggest me good institute.I heard about Nageshwara Rao sir institute for testing tools.Now which one is good so i can get job in testing tools. please help me.....where to join in hyd.

2026

What is Pic 9v99 Indicates in COBOL?

1179