Problem to solve:
Implement doubly linked list using Java. Design a method to find the middle node of a doubly-linked list using at least two ways. In the case of an even number nodes, report the node slightly left of center as the "middle".
How can you tell which way is better? Evaluate your Java code using both experimental studies and asymptotic analysis.