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 }

3155

---

Does microsoft word come with windows 10?

545

---

What are the two components that you can integrate jenkins with?

1

---

What are the steps to take to improve performance of a poor performing query? : sql server database administration

1001

---

What is the 3-tier architecture?

877

---

Hi All, Can any one please send me the difference between informatica 7i and 8i versions, Thanks in advance. vinod

1961

---

How do I split text in word?

584

---

Explain what are delegates?

1075

---

What is big data in database?

859

---

Can primary key be null postgres?

787

---

Explain about the sybase group?

880

---

what is timestamp in mysql? : Sql dba

1036

---

During the Display time, how is the sequence generated by Teradata?

999

---

What is a reverse linked list.

1003

---

How Directives are compiled?

1375

---