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
#include
Post New Facebook C Interview Questions
What do you mean by thread safe in c#?
What are oop templates?
Why * is used in css?
What are the different types of datawarehosuing?
Should I use pop or imap?
What are the different sections in a transformation file?
What is the use of send redirect () method?
How do I quit mysql?
How can you test the global servers with using loadrunner
what is spandex?
What is an argument in swift?
If given a chance to do something for the society to eradicate poverty, what will your initial step?
What is the purpose of talend runtime?
What are the limitations of Quick create form with respect to controls and design?
What is the difference between JDK and JVM?