In this assignment, please assume the Singly and Doubly Linked Lists have tails.

Singly Linked Lists and Doubly Linked Lists

Please write pseudocode for the following functions:

Erase$($key$)$ in Singly Linked List

AddBefore$($Node$,$ Key$)$ in Singly Linked List

PopBack$()$ in Doubly Linked List

Example: pseudocode for PushFront$($key$)$

PushFront$($key$)$:

new$\_$node $=$ Node$($key$)$

new$\_$node.next $=$ head

head $=$ new$\_$node

if tail $==$ null:

tail $=$ new$\_$node

PLEASE USE THE TEMPLATE:

$1.$ The Pseudo$-$code for Erase$($key$)$ in Singly Linked List:

Erase$($key$)$:

$[$please finish this method$]$

$2.$ AddBefore$($Node$,$ Key$)$ in Singly Linked List

AddBefore$($Node$,$ Key$)$:

$[$please finish this method$]$

$3.$ PopBack$()$ in Doubly Linked List

PopBack$()$:

$[$please finish this method$]$