Answer Posted / sarvesh

#include<stdio.h>
#include<conio.h>
main()
{
int i,n,j;
int m=1;
clrscr();
printf("enter number");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<=i;j++)
{
printf("%d",m++);
}
printf("\n");
}getch();
}

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 }

2720

---

what is the role you expect in software industry?

1660

---

What is a good data structure to use for storing lines of text?

604

---

Explain what are binary trees?

616

---

Is c is a middle level language?

602

---

---

How does sizeof know array size?

634

---

Is python a c language?

555

---

What is FIFO?

678

---

What is a pointer in c plus plus?

700

---

What is #include conio h?

598

---

What is call by value in c?

565

---

What is a example of a variable?

559

---

to find the closest pair

1827

---

How can I remove the trailing spaces from a string?

620

---

How can I do serial ("comm") port I/O?

695

---