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
Which is better cte or subquery?
How do I add a column to a table in word 2013?
What is cross site script inclusion (xssi)?
What is the use of dataframe in spark?
What is cocoa touch framework in ios?
How can we specify system properties in tomcat configuration on startup?
What are the different types of variable available in the task editor?
Do we need a special driver to access data within hana? : hana modeling
What is an array formula in excel?
What is the difference between SharePoint 2013 and 2016?
What are the associated border-radius properties?
Explain the biological neuron model.
Why do you want to join in SEBI?
how many files, printer files you can describe in a rpg?
How do I restore my toolbar in excel?