title: How to find max and min element in a LinkedList most efficiently?
body: <p>I have a linked list in Java ,say , <code>LinkedList&lt;T&gt; list = new LinkedList&lt;T&gt;();</code> and I need to find the max / min element in it most efficiently , how can I do it?</p>
  
  <p>How can I use <code>Collections.max()</code> function to find the max element from my linked list? What is the time complexity of this function ?</p>