Algouniversity - Nomdic Gurukul - 14th august

In order traversal of binary search tree will produce ?

• unsorted list

• reverse of input

• sorted list

• none of the above

In order traversal of binary search tree will produce ?

• unsorted list
• reverse of input
• sorted list
• none of the above

push() and pop() functions are found in

• queues
• lists
• stacks
• trees

Minimum number of queues required for priority queue implementation?

• 5.0
• 4.0
• 3.0
• 2.0

The minimum number of edges required to create a cyclid graph of n vertices is

• n
• n-1
• n+1
• 2n

What about recursion is true in comparison with iteration?

• very expensive in terms of memory.
• low performance.
• every recursive program can be written with iteration too.
• all of the above are true!