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
Tell me how to implement you own package in laravel?
What is the purpose of the queue ?
In Hive, can you overwrite Hadoop MapReduce configuration in Hive?
What is the difference between the positional and keyword parameters? Give examples.
Explain bootstrap 4 images?
What are various storage types permitted by openstack compute?
What are the different types of keys in the database?
What are the examples of standard spring events?
How will A Medium voltage circuit breaker(11 kV voltage level) operate under short circuit fault condition whether It is having short circuit release like Low voltage circuit breaker or relay should be given?
How long do struts last?
Why is work scheduling required for semi finished and finished products?
Can we run sh file in windows?
What is ‘Training set’ and ‘Test set’?
What are the actions that can occur when a thread enters blocked state?
What are the characteristics of 'scope'?