1 votes 1 votes Which of the following problem cannot be solved without recursion? Tower of Hanoi Fibonacci series Tree Traversal None of the above Unknown Category uttarakhand-asst-prof-2018 data-structures + – gatecse asked Mar 2, 2018 • edited Mar 6, 2018 by go_editor gatecse 2.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply Lakshman Bhaiya commented Mar 2, 2018 reply Follow Share All problem solve using recursion and without recursion. So, answer is (d) 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Tower of Hanoi: Has Recursive solution as well as Non-Recursive Solution Fibonacci Series : can be solved by Recursion and without Recursion Tree Traversal : Has Recursive, Iterative solutions ∴ None of the above will be the answer Sukanya Das answered Mar 5, 2018 • edited Mar 5, 2018 by Sukanya Das Sukanya Das comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer is none of these. All three can be solved using both recursive and iteration. Few extra points Not all function that can be solved with recursion cannot be solved without recursive. The Ackermann function cannot be expressed without recursion. smsubham answered Mar 19, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.
