41
One can convert a binary tree into its mirror image by traversing it in

Answer: Option [C]

Questions

41
One can convert a binary tree into its mirror image by traversing it in

Answer: Option [C]

42
The data structure required to evaluate a postfix expression is

Answer: Option [B]

43
Which of the following sorting methods would be most suitable for sorting a list which is almost sorted

Answer: Option [D]

44
The process of accessing data stored in a serial access memory is similar to manipulating data on a

Answer: Option [C]

46
A linear collection of data elements where the linear node is given by means of pointer is called

Answer: Option [A]

49
The complexity of multiplying two matrices of order m*n and n*p is

Answer: Option [D]

50
For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

Answer: Option [B]