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,

---

What is meant by keywords in c?

0 Answers  

---

what is ans for this scanf(%%d",c);

1 Answers  

---

What is a program flowchart and how does it help in writing a program?

0 Answers  

---

Why flag is used in c?

0 Answers  

---

how can i get output like this? 1 2 3 4 5 6

6 Answers   Excel,

---

What are data types in c language?

0 Answers  

---

if a is an integer variable, a=5/2; will return a value a) 2.5 b) 3 c) 2 d) 0

0 Answers  

---

What is break statement?

0 Answers  

---

Explain the priority queues?

0 Answers  

---

void main() { int a=1; while(a++<=1) while(a++<=2); }

4 Answers   HCL,

---

Why is a semicolon (;) put at the end of every program statement?

0 Answers  

---