Write the inorder, preorder and postorder traversals of the following binary search tree.
I see you want the traversals for _____ ______ _____ _____ ____ _______ ____ ______.
____ ___ ____ ____ ________ ________ ____ ________.
____ __________ _______ ______ ________ ________ _______ ____ __________ _________ ______ ___.
________ _____ ________ _______ ___ _____ _______.
____ ___ ______ _________ _______.
Get Full Answer on WhatsApp
Explain how will you allocate memory dynamically for a two dimensional array of floating point numbers.
Write the output of the following C codes, with proper justification for each.
i) main()
{
int x = 2, y = 2, z = 2;
x = y == z;
y = z == x;
z = x == y;
printf("%d", z);
} ii) main()
{
int x = -1, y;
x++;
y = x ? 2+x : 3-x;
printf("%d", y);
}
iii) main()
{ int i, j, a = 0;
for(i = 1, j = 1; i <= 5; j++)
{
a = a + i*j++; i = j;
}
printf("%d ", a);
}
iv) main()
{
int x = 5, y = 12;
int *p = &x, *q = &y, *r;
r = p;
p = q;
q = r;
printf("%d, %d", x, y);
}
v) func(int x)
{
static int a = 0;
a += x;
return(a);
}
main()
{ int p;
for(p = 1; p <= 5; ++p)
printf("%d", fun(p));
}
What do you understand by file organisation? Explain the methods of file organisation.
You might recall that the Euler number e can be represented by the following series:
Write a program that approximates e with desired number of terms as entered by the user.
zWrite a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa.
Parenthesise the following C statement for its proper evaluation.
x + = a%b + c ∗ d/e ! = f + + − g
Further, if all the variables from a to g are initialised by 2, then what will be the value of x?
Explain the arguments of the functions scanf() and printf(), and how they work with an example for each.