Answer Posted / marimuthu

By simple

1.find length of each word
2.insert into binary search tree
3.recursively get the left most child of the right sub tree. finally you will get the second largest word.

via this logic you can smallest word,largest word.

is it have criticize?? mail me rainpearls.v@gmail.com

Why we use conio h in c?

1236

---

What is variable declaration and definition in c?

898

---

When we use void main and int main?

1087

---

Difference between macros and inline functions? Can a function be forced as inline?

1274

---

how do you execute a c program in unix.

1113

---

1. Write a function to display the sum of two numbers in the following ways: By using (i) pass by value (ii) pass by address a. function with argument and with return value b. function with argument and without return value c. without argument , with return value d. without argument , without return value Note: Use pass by address.

2814

---

How many types of errors are there in c language? Explain

987

---

What is static memory allocation?

1178

---

Why is extern used in c?

1092

---

What is c variable?

1046

---

please can any one suggest me best useful video tutorials on c i am science graduate.please help me.u can email me to sas29@in.com

1775

---

Why malloc is faster than calloc?

1066

---

What are the types of type specifiers?

1039

---

What is omp_num_threads?

1085

---

why programs in c are running with out #include? some warnings are display in terminal but we execute the program we get answer why? eg: main() { printf("hello world "); }

1765

---