Answer Posted / suriya

put all nos. in an array and sort it using selection sort in
ascending order the last no. will be the second highest no.

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

---

Why do we use pointer to pointer in c?

1086

---

How can I determine whether a machines byte order is big-endian or little-endian?

1065

---

Do you know the use of 'auto' keyword?

1204

---

The number of bytes of storage occupied by short, int and long are a) 2, 2 and 4 b) 2, 4 and 4 c) 4, 4 and 4 d) none

1246

---

Is using exit() the same as using return?

1361

---

Explain how do you use a pointer to a function?

1111

---

How main function is called in c?

1127

---

Do pointers take up memory?

1161

---

What does == mean in texting?

1308

---

What are the key features in c programming language?

1076

---

There seem to be a few missing operators ..

1051

---

What is the difference between ‘g’ and “g” in C?

4012

---

Can we replace the struct function in tree syntax with a union?

1310

---

What are enums in c?

1208

---