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 does it work under-the-hood, when we create an instance of a Class without using ‘new’ keyword in Scala? When do we go for this approach?
Explain the difference between type ii with examples.
What is inheritance in term of oop (flash actionscript)?
What is skew data?
Define What is unit weight of normal concrete?
What are the drawbacks of extending an interface as opposed to extending a class?
How to use select query in laravel?
Explain about membership operator in python?
Do all html tags have an end tag?
In go language how you can check variable type at runtime?
Can you create a logon trigger in sql server 2005 express edition?
Explain how to perform remoting?
By using which bw palette we can create db table?
How do I align columns in word?
If I am trying to assign a variable the value of 0123, but it keeps coming up with a different number, whats the problem?