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 is application component provider?
How you integrated your automated scripts from TestDirector?
explain the concept of RDD (Resilient Distributed Dataset). Also, state how you can create RDDs in Apache Spark.
what are the type of cash flows?
How do I access my wordpress files?
What is the main purpose of serialization in java?
How can we use a lightning component in a visaulforce page? Explain?
Explain the microsoft sql server delete command? : sql server architect
Where do we store our connection string in asp.net application?
What are the advantages and disadvantages of using a spreadsheet?
Explain the data type of the surrogate key?
What is meant by human security?
Can you define phonetic filter?
What is the difference between exit() and _exit() function?
What is the starting point of code execution in jquery?