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
How did you perform validation in angularjs?
What are vldb properties?
Are comments included during the compilation stage and placed in the EXE file as well?
How do I activate javascript on my phone?
Explain how to configure the license of orbix 3.3?
How does xaml relate to registries (uddi)? : xaml
What are the different commands used in idcams for vsam?
Can you explain cloudera navigator?
What is proprietary ratio? What are its components?
What is the purpose of xssfrow class in apache poi?
What is the role of NABARD in developing the economy?
What are the advantages/disadvantages of using inline and const?
Why background and color are the separate properties if they should always be set together?
What are the two types of comments?
How do you set margins in powerpoint 2016?