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 s in c?

0 Answers  

---

What is volatile, register definition in C

0 Answers   Cognizant,

---

Write a C program that reads a series of strings and prints only those ending in "ed"

2 Answers   Accenture,

---

write a program fibonacci series and palindrome program in c

0 Answers   Aditi Placement Service,

---

How many ways are there to swap two numbers without using temporary variable? Give the each logic.

9 Answers  

---

What is information technology.

1 Answers  

---

Write a program or provide a pseudo code to flip the 2nd bit of the 32 bit number ! (Phone Screen)

1 Answers   NetApp, PTU, Wipro,

---

What does %p mean?

0 Answers  

---

What is type qualifiers?

0 Answers  

---

What's the best way to declare and define global variables?

7 Answers  

---

How to add two numbers without using semicolon n c????

3 Answers  

---