Which of the following data structures is used in implementing recursive calls?

2018

Which of the following data structures is used in implementing recursive calls?

Answer: C. Stack — Recursive calls are implemented using a stack data structure because of the Last-In-First-Out (LIFO) behavior needed for managing function call frames. Each…

  1. A.

    Queue

  2. B.

    Binary Tree

  3. C.

    Stack

  4. D.

    Hash Table

Attempted by 1985 students.

Show answer & explanation

Correct answer: C

Recursive calls are implemented using a stack data structure because of the Last-In-First-Out (LIFO) behavior needed for managing function call frames. Each invocation adds a frame to the stack, which is popped upon return.

Explore the full course: Rssb Basic Computer Instructor

Loading lesson…