problem206

README

< Previous 　　　　　　　　　　　　　　　　 Next >

206. Reverse Linked List (Easy)

Reverse a singly linked list.

Example:

Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL

Follow up:

A linked list can be reversed either iteratively or recursively. Could you implement both?

Related Topics

[Linked List]

Similar Questions

1. Reverse Linked List II (Medium)
2. Binary Tree Upside Down (Medium)
3. Palindrome Linked List (Easy)

Documentation

Index

• type ListNode

Types

type ListNode

type ListNode = kit.ListNode

ListNode - Definition for singly-linked list.