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 }

3194

---

What are the major responsibility's of an accountant? what are the qualities he /she requires?

2117

---

What is df -h command?

1156

---

What are the protections in a Diesel generator Engine?

2271

---

Is there any difference between int[] a and int a[]?

1185

---

What does partition by mean in sql?

970

---

What are the features of UML?

918

---

What is difference between Recording time object identification and Run time (Execution) time.

1650

---

What are the benefits of hibernate over jdbc?

385

---

How do you get the width of the textbox?

964

---

win 3.1 is a

1138

---

How do you execute a thread in java?

961

---

In what context should the value of swing components be updated directly?

945

---

Explain the use of gear pumps in motor?

1014

---

Can you update props in react?

436

---