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;i<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

0 Answers   Facebook,

---

Do pointers take up memory?

0 Answers  

---

which is faster execution: loops or recursion?

3 Answers  

---

How many main () function we can have in a project?

0 Answers  

---

Explain what are the different data types in c?

0 Answers  

---

compute the nth mumber in the fibonacci sequence?

10 Answers   Canon, HPL, Satyam, TCS,

---

What is the purpose of 'register' keyword?

0 Answers  

---

what is the difference between unix os and linux os

4 Answers  

---

WHAT IS MAXIMUM SIZE OF AN ARRAY IN C LANGUAGE?

8 Answers   Carphone Warehouse, IBM, SAS,

---

wat is the meaning of c?

9 Answers   CTS, IBM, Wipro,

---

what is the differance between pass by reference and pass by value.

7 Answers   Infosys,

---

Function shall sum members of given one-dimensional array. However, it should sum only members whose number of ones in the binary representation is higher than defined threshold (e.g. if the threshold is 4, number 255 will be counted and 15 will not) - The array length is arbitrary - output the results to the stdout

0 Answers   XYZ,

---