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 }

3191

---

23. What is SBC

2107

---

differences between poco, model first and data first approach?

1217

---

What is meant by annotation in hibernate?

351

---

why does drupal need a database?

98

---

How to download xcode for iphone development?

729

---

How it is different from gsm?

743

---

What web sites do you feel use javascript most effectively (i.e., Best-in-class examples)? The worst?

934

---

How to fill element (initialize at once) in an array?

1021

---

13. How many TRX are supported when we use one M2HA card in BTS? 14. Name the different types of power supply card in BTS and the output power of each card

2050

---

hello sir iam atul joshi from mechanical branch. i want to know about the syllabus of technical ques of jindal steel

1965

---

Compare RDBMS with Hadoop MapReduce.

631

---

What are the different new form element types in html 5?

856

---

What do you mean by a service fabric in azure?

581

---

Which is better php or wordpress?

950

---