Determine if this linked list is empty. This is an O(1) computation

View the last value in the linked list. This is O(n)

Modify the last value in the linked list. This is O(n)

* @author Conrad Ludgate <conrad.ludgate@email.com> * @author Nils "Borrow Stack" Not in the <ralf.jung@why.does.miri.complain.com> * @autho

Pop from the back of the linked list. This is O(n) ``` # use linked::LinkedList; let mut ll = LinkedList::from_iter([1, 2]); assert_eq!(ll.pop_back()

Push to the back of the linked list. This is O(n) ``` # use linked::LinkedList; let mut ll = LinkedList::new(); ll.push_back(1); ll.push_back(2); ass