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 to add actions in driver script to run those actions in QTP?
Which table holds the encrypted login password?
what is restricted earth fault explain in details
What is difference between class and structure?
Why #include is used?
How to create an rdd?
Why are arrays useful in java?
What does round trip time mean?
Why does marble rarely contains fossils?
What is encapsulation in java?
Transformer cores are laminated in order to A simplify its construction B minimize eddy current loss C reduce cost D reduce hysterisis loss
Why do all model object attributes get marked with @dynamic and not synthesised?
Will react hooks replace redux?
What is the difference between war file and jar file?
What are the benefits of using ember.js?