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 }

3195

Is swift better than c++?

956

What are the Disadvantages of shared object repository?

1145

What are the key differences between Pig vs MapReduce?

618

What is infinite loop?

1101

In EB metering we face problem kva jump even in no load condition.can any one help to control this

1851

If you are using logical databases how will you modify the selection-screen elements?

344

Is it necessary to know java to learn hadoop?

675

Is pluto really a planet?

109

Comment on batch normalization?

902

can you send me the previous years drug inspector exam model papers of andhrapradesh

2424

Write an algorithm to show the reverse of link list?

868

Tell us why would you do the setcontentview() in oncreate() of activity class?

913

I have done BE ( computer science) i secleted in sbi clerical written exam. so what questions they asked according to my subject please send me the answer

1990

Difference between star and snowflake schemas?

1162