New Enroll here to Join NaBFID Analyst Into Class on May 6

    Question

    Which data structure is most suitable for implementing

    recursion?
    A Stack Correct Answer Incorrect Answer
    B Queue Correct Answer Incorrect Answer
    C Linked List Correct Answer Incorrect Answer
    D Array Correct Answer Incorrect Answer
    E Hash Table Correct Answer Incorrect Answer

    Solution

    A stack is the most suitable data structure for implementing recursion. This is because recursive calls need to store the state of the current function execution before jumping into the next function call. Stacks follow the Last In, First Out (LIFO) principle, which perfectly suits the recursive function call structure. Why Other Options are Wrong: b) A queue follows First In, First Out (FIFO), which doesn’t support the nature of recursion. c) Linked lists can be used for dynamic memory but are not suitable for managing function calls in recursion. d) Arrays have a fixed size and do not inherently support LIFO behavior. e) Hash tables are for storing key-value pairs and have no role in recursion.

    Practice Next