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 do I use hotmail with outlook?
What are the various controls in the application designer tool in ibm maximo part 4:
did perceptions of a few peoples can affect the positioning of something or some products in the market? do they?
How to present flrehird.log file from filling up the disk partition?
tell me about your project functionality
What is UML diagram in C#?
What are factory method in angularjs?
Define a tree?
What is router-outlet directive in angular 2?
What exactly is methodology?
What the sp register does in a program?
Explain percentage approved.
Can drinking coffee is harmful for teeths?
What is SARFAESI Act
What is side by side migration in sql server?