Answer Posted / sanju_south

r+ which is read write and append also

What is a dynamic array in c?

1160

---

What are the different categories of functions in c?

1138

---

Explain how can I right-justify a string?

1046

---

What is c value paradox explain?

1099

---

How do I use void main?

1091

---

How can you call a function, given its name as a string?

1158

---

`write a program to display the recomended action depends on a color of trafic light using nested if statments

2135

---

What are directives in c?

974

---

What are the types of unary operators?

1191

---

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

3189

---

What is the purpose of 'register' keyword in c language?

1030

---

What is pointer & why it is used?

1121

---

What would be an example of a structure analogous to structure c?

1000

---

How can I write a function that takes a format string and a variable number of arguments?

1057

---

What does node * mean?

1227

---