Write the inorder, preorder and postorder traversals of the following binary search tree
The inorder, preorder and postorder traversals of the given binary search tree are:
Inorder Traversal: B C E F G H I J
Preorder Traversal: G C B E F I H J
Postorder ________ ___ _____ ________ _________.
________ ____ _____ _________ ______ ________ __________ ____.
______ ____ _________ ______ ________ ___.
__________ _____ ___ _______ _________ ______ __________ _________ ________ ______ ____.
_____ _________ _________ _________ _____ _____ ____.
____ __________ __________ ______ _______ _______ _____ ________ ______ ________ _____.
__________ __________ _______ ____ _____ ____ _______.
___ _________ ____ ________ ________ ___.
____ ______ ____ ________ _________ ___ ______ _____ _______.
_________ _______ ______ ________ __________.
_______ ______ __________ ____ _______ __________ _______ ______ _____ ______ _____.
___ _______ ________ _________ ___ _______ _____ ______ ________ _____.
___ _____ _____ __________ _____ _____ ____ _________ ____ ___ _______ __________.
___ _______ __________ _________ _______ ______ _______.
___ _________ ________ ______ ________ __________ _________.
_________ ______ ____ _________ __________ _______ _____ __________ ________ __________ ______.
________ _______ _____ _____ _______ _______ _______ _________ _______.
____ _________.
Get Full Answer on WhatsApp
How would you differentiate between the terms pointer to an array and array of pointers? Give proper examples.
Suppose you wish to solve the equation for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005
A C program contains the following statements:
char u, v = ‘A’;
char *pu, *pv = &v;
*pv = v+1;
u = *pv + 1;
pu = &u;
Suppose each character occupies one byte of memory. If the value assigned to u is stored in (hexadecimal) address F8C and the value assigned to v is stored in the address F8D, then
i) What value is represented by &v?
ii) What value is assigned to pv?
iii) What value is represented by *pv?
iv) What value is assigned to u?
v) What value is represented by &u?
vi) What value is assigned to pu?
Consider the following structure declaration of a doubly linked list:
struct dlink
{
int nodeid;
dlink *next;
dlink *prev;
} dlink t;
A pointer of the head of the linked list is maintained as a global variable, whose
definition is
dlink t *head;
The function remove element(dlink t *rp) defined below needs to remove the
node pointed to rp and adjust the head. The first node’s prev and the last node’s
next are NULL.
remove element(dlink t *rp)
{
rp->prev->next = rp->next;
rp->next->prev = rp->prev;
if(head == rp)
head = rp->next;
}
Explain whether the function remove element() works properly or not.
Write a function that evaluates an expression in RPN that is given as a string.
What does the following C function compute? Discover.
int some fun(int n)
{
if(n%2 == 0)
return 2;
int d, s = sqrt(n);
2
for(d = 3; d <= s; d = d+2)
if(n%d == 0)
return d;
return n;
}
What do you understand by file organisation? Explain the methods of file organisation.