What is the advantage of recursive approach than an iterative approach?

Related MCQs

• What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
• What is the time complexity of pre-order traversal in the iterative fashion?
• What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
• What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
• Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
• The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
• Which of the following is not an advantage of priority queue?
• Which of the following is not an advantage of trees?
• What are the conditions for an optimal binary search tree and what is its advantage?
• Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?