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 customization.
Define universe?
Does sql*plus have a pl/sql engine?
What are the disadvantages of surface automation?
What is difference between sql and rdbms?
What do you mean by structural authorization? What is its use?
What is a swing day?
What is standard controller? : salesforce visualforce
Explain is there any tool that can compare two unvs / two rpts , built using bo 5.1 / bo 6.5?
What are the advantages of using friend classes?
Tell good things and bad things about graduation stream.
How do I know if my windows 10 is corrupted?
How requirements( pir,sles order, customer requirement) are reduced after they are produced?
How do I get activex on my computer?
Difference between business sale cycle nd customer sale cycles?