- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- What is the advantage of recursive appro...

Q. |
## What is the advantage of recursive approach than an iterative approach? |

A. | Consumes less memory |

B. | Less code and easy to implement |

C. | Consumes more memory |

D. | More code has to be written |

Answer» B. Less code and easy to implement |

View all MCQs in:
Data Structures (DS)

- 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)
- 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?
- What is the advantage of selection sort over other sorting techniques?
- What is the advantage of the multiplication method?

Login to Continue

It will take less than 2 minutes

Report MCQ