https://naresh.se/en/categories/blog/Recent content in Blog on Naresh MehtaHugo -- gohugo.ioennaresh.mehta@gmail.com (Naresh Mehta)naresh.mehta@gmail.com (Naresh Mehta)&copy;{year}, All Rights ReservedMon, 05 Jun 2017 16:49:17 +0200weeklyhttps://naresh.se/en/posts/2017/3480/Mon, 05 Jun 2017 16:49:17 +0200naresh.mehta@gmail.com (Naresh Mehta)Wed, 16 Apr 2025 18:13:58 +0200https://naresh.se/en/posts/2017/3480/<p>Today&rsquo;s topic is pretty simple. Let&rsquo;s print a linked list in reverse. And it is a singly linked list meaning you can only traverse in one direction and not come back. You are only given a pointer to the head. So without further ado, below is the c++ code. Only the important parts are shown. Rest is left as an exercise for the reader to create a fully working program.</p>Naresh Mehtablog