Select the running time complexity $($on average$)$ based on input n $($using Big$-$Oh notation$)$ for the following different data structures and their associated operations:

Single Linked list $-$ Find element:

$[$ Select $]$

Single Linked list $-$ Find maximum:

$[$ Select $]$

Doubly Linked list $-$ Insert element at the beginning:

$[$ Select $]$

Doubly Linked list $-$ Remove element at the end:

$[$ Select $]$

Stack $-$ Find element:

$[$ Select $]$

Stack $-$ Remove element from the top:

$[$ Select $]$

Binary search tree $-$ Find element:

$[$ Select $]$

Binary search tree $-$ Remove element at root:

$[$ Select $]$