Answer Posted / guest

error

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;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

3189

---

What is memory leak in c?

1129

---

Why c is called object oriented language?

1072

---

using for loop sum 2 number of any 4 digit number in c language

2347

---

What is binary tree in c?

1105

---

Differentiate between the = symbol and == symbol?

1301

---

What is graph in c?

1059

---

What does c mean?

1050

---

What are integer variable, floating-point variable and character variable?

1253

---

What are the types of operators in c?

1064

---

When should structures be passed by values or by references?

1043

---

what are the advantages of a macro over a function?

1146

---

What is a 'null pointer assignment' error?

1218

---

Write a c program to build a heap method using Pointer to function and pointer to structure ?

4688

---

What is the use of header?

1093

---