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 }

3244

---

What do you understand by Hybris Modeling?

5

---

By using set next stage, we can do “fast-forward” or “rewind”?

580

---

What windows files can I delete to free up space?

861

---

Why apache kafka?

655

---

What does this () mean in constructor chaining concept?

1211

---

What are the basic components of windows?

880

---

How does a jsp work?

953

---

What is application variable?

1011

---

Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?

1014

---

How to link tables in sql server?

976

---

What are two methods of modifying sap standard tables?

1207

---

There are two file are there .1st file contains 5 records and 2nd file contain 10 records in target they want 50 records.how can achieve this

2294

---

What is cloudformation?

607

---

What is the trouble in growing streptococcus species?

2239

---