We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
It is the recursion stack, each time a recursive function is called, it records the state of its variables and pushes that on a stack, then when the end condition is reached (like in this case, the if condition that returns head), the whole stack unravles in LIFO manner and respective operations are performed.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a linked list
You are viewing a single comment's thread. Return to all comments →
It is the recursion stack, each time a recursive function is called, it records the state of its variables and pushes that on a stack, then when the end condition is reached (like in this case, the if condition that returns head), the whole stack unravles in LIFO manner and respective operations are performed.