×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
The inorder and the preorder traversals of a binary tree are d b e a f c g and a b d e c f g respectively. What is its postorder traversal?
2.
Consider the following C function:
The single-linked list of integers is taken as a parameter and the function rearranges the elements of the list
The function is called with the list containing the integers in the order: 1, 2, 3, 4, 5, 6, 7
What are the contents of the list after the function execution?
The single-linked list of integers is taken as a parameter and the function rearranges the elements of the list
The function is called with the list containing the integers in the order: 1, 2, 3, 4, 5, 6, 7
What are the contents of the list after the function execution?
struct node
{
int value;
struct node *next;
};
void rearrange(struct node *list)
{
struct node *p, * q;
int temp;
if ((!list) || !list -> next)
return;
p = list;
q = list -> next;
while(q)
{
temp = p -> value;
p -> value = q -> value;
q -> value = temp;
p = q -> next;
q = p ? p -> next:0;
}
}
{
int value;
struct node *next;
};
void rearrange(struct node *list)
{
struct node *p, * q;
int temp;
if ((!list) || !list -> next)
return;
p = list;
q = list -> next;
while(q)
{
temp = p -> value;
p -> value = q -> value;
q -> value = temp;
p = q -> next;
q = p ? p -> next:0;
}
}
3.
How is an element inserted in the queue?
struct queue
{
int Q[20];
int f, r;
} Q;
{
int Q[20];
int f, r;
} Q;
4.
A binary tree generates the sequence ABCDEFG for an inorder traversal and the sequence ACBGFED for a postorder traversal. What are the total number of nodes in the left subtree of this binary tree?
5.
What is the output of the following Java code:
import java.util.*;
class TestClass {
public static void main(String args[]) throws Exception {
Stack s = new Stack();
s.push("A");
s.push("B");
System.out.println(s);
System.out.println(s.search("Z"));
System.out.println(s.isEmpty());
}
}
class TestClass {
public static void main(String args[]) throws Exception {
Stack s = new Stack();
s.push("A");
s.push("B");
System.out.println(s);
System.out.println(s.search("Z"));
System.out.println(s.isEmpty());
}
}
6.
What is the time complexity of the following code snippet:
function(int n) {
if (n == 1) return;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
printf("*");
function(n - 1);
}
if (n == 1) return;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
printf("*");
function(n - 1);
}
7.
What is the time complexity of the following code snippet:
function(int n) {
if (n == 1) return;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
printf("*");
break;
}
}
}
if (n == 1) return;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
printf("*");
break;
}
}
}
8.
A priority queue is implemented as a max heap. Initially, it has 5 elements. The level-order traversal of the heap is 10, 8, 5, 3, 2. Two new elements '1‘ and '7‘ are inserted in the heap in that order.
What is the level-order traversal of the heap after the insertion of the new elements?
What is the level-order traversal of the heap after the insertion of the new elements?