{"id":151,"date":"2018-02-25T05:43:59","date_gmt":"2018-02-25T05:43:59","guid":{"rendered":"http:\/\/www.datastructure.org\/?p=151"},"modified":"2025-04-21T13:49:11","modified_gmt":"2025-04-21T13:49:11","slug":"reverse_a_singly_linked_list","status":"publish","type":"post","link":"https:\/\/www.bhargaviurs.com\/index.php\/2018\/02\/25\/reverse_a_singly_linked_list\/","title":{"rendered":"Reverse a Singly Linked List"},"content":{"rendered":"\n

<\/p>\n\n

The idea is to always keep a reference to the previous-node and next-node. We will always be operating in the context of the current node.<\/p>\n

In every iteration, the steps will be:
1. Get reference to next node.
2. Detach the link between current and next node.
3. Create a link between current and previous node.
4. Update Previous node – The new previous node will be the present current node.
5. Update reference to current node – The new current node will be the present next node.<\/p>\n

All of the above performed in that order. The iteration ends when current node becomes null.<\/p>\n

We use 3 references:<\/p>\n

    \n
  1. prev – refers to the previous node.<\/li>\n
  2. curr – refers to the current node.<\/li>\n
  3. next – refers to the next node.<\/li>\n<\/ol>\n

    Here is an example:<\/p>\n

    \"\"\"\"\"\"<\/p>\n\n

    prev = None\ncurr = start\nwhile curr != None: \u00a0 \u00a0 \u00a0 \u00a0\n    next = curr.link \u00a0 \u00a0 \u00a0 \u00a0\n    curr.link = prev \u00a0 \u00a0 \u00a0 \u00a0\n    prev = curr \u00a0 \u00a0 \u00a0 \u00a0\n    curr = next\n    start = prev<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
    The idea is to always keep a reference to the previous-node and next-node. We will always be operating in the context of the current node. In every iteration, the steps will be:1. Get reference to next node.2. Detach the link between current and next node.3. Create a link between current and previous node.4. Update Previous … <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[],"class_list":["post-151","post","type-post","status-publish","format-standard","hentry","category-linked-list","entry"],"_links":{"self":[{"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/posts\/151","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/comments?post=151"}],"version-history":[{"count":1,"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/posts\/151\/revisions"}],"predecessor-version":[{"id":490,"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/posts\/151\/revisions\/490"}],"wp:attachment":[{"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/media?parent=151"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/categories?post=151"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.bhargaviurs.com\/index.php\/wp-json\/wp\/v2\/tags?post=151"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}