---
title: "What is the data structures used to perform recursion?"  
description: "What is the data structures used to perform recursion?"  
author: "Sumit Kesarwani"  
published: 2014-09-22  
updated: 2020-09-23  
canonical: https://www.mindstick.com/interview/2171/what-is-the-data-structures-used-to-perform-recursion  
category: "c#"  
tags: ["c#"]  
reading_time: 1 minute  

---

# What is the data structures used to perform recursion?

Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls.

Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.

## Answers

### Answer by Sumit Kesarwani

Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls.

Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.


---

Original Source: https://www.mindstick.com/interview/2171/what-is-the-data-structures-used-to-perform-recursion

Copyright © MindStick Software Pvt. Ltd. This Markdown version is provided for developers, AI systems, and offline reading.