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 the c source code for the below output? 5555555555 4444 4444 333 333 22 22 1 1 22 22 333 333 4444 4444 5555555555

0 Answers   Wipro,

---

without a terminator how can we print a message in a printf () function.

7 Answers   NIIT,

---

1. Write a program to reverse every second word in a given sentence.

1 Answers  

---

In C programming, how do you insert quote characters (‘ and “) into the output screen?

0 Answers  

---

What is array in C

0 Answers  

---

program to find the magic square

1 Answers   Infosys,

---

an algorithem for the implementation of circular doubly linked list

1 Answers  

---

How we can insert comments in a c program?

0 Answers  

---

Why is python slower than c?

0 Answers  

---

Write the test cases for checking a variable having value in range -10.0 to +10.0?

0 Answers   Bosch,

---

Why are algorithms important in c program?

0 Answers  

---