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 the definition for sql server 2000?
If you are rejected today, then what will you do?
List some popular graph databases?
which targeting method would you use to reach these people?
How do you decide whether to fine-tune or train a model from scratch?
Can we use loop in sql?
What r the foll tax deductions for :- 1.TDS 2.WCT Give me answers in detail & give me some addtional info on these topics which would be helpful for me.
Explain the purpose of composition.
Explain what is record meta data?
Do you know history of cdma?
How do I resize all images in a powerpoint presentation?
How is venus like earth?
what is rate of service tax and form no. of service tax ? wt rules of service tax a particuler once .?
How do I create a view in drupal 7?
What is in mkdir command?