A Singly Linked List has a node containing the data and, at most, one reference pointing to the next node. If we try to represent a Singly Linked List in a diagram to make you understand it, this is what it looks like:
Let's implement a Singly Linked List to understand it further:
class LinkyList<E> {
private var size = 0
private var head: Node<E>? = null
private var tail: Node<E>? = null
private inner class Node<E> constructor(internal var element: E, internal var next: Node<E>?)
}
The preceding snippet isn't the full implementation of a Singly Linked List. It's just a template of what the data structure looks like. We'll keep on adding multiple methods to perform different operations. A few points to remember from the preceding snippet are as follows:
- The class name is modified...
