A basic implementation of a doubly linked list in JavaScript.

Limitations:

The search function assumes each node has a simple value (string, number, boolean, null, or undefined). It is not able to find nodes with an obect for a key. 

The search function will return the first matching node in cases when multiple nodes have the same key. 

The remove function will corrupt the list if given a node that is not in the list.