Answer Posted /

Is This Answer Correct ?    Yes No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What are the goals of zend framework?

145


How will you create a file in perl?

517


How do I unhide toolbar in excel 2016?

328


What do I do when my hard drive is full?

479


What is the difference between classical ai and statistical ai?

812






What data in material master is maintained at the client level?

627


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 }

2702


What is dataset c#?

483


Explain thrashing.

554


What is windows search used for?

495


What is the function of a data element?

611


Explain importance of throws keyword in java?

558


What is pass by value and pass by reference? How are structure passed as arguments?

486


Is it possible to use primary key of one table as a primary key in many other tables?if yes, how?

406


What is the function of ui api i.e. User interface api ?

635