title: Shortest possible depth of a leaf in decision tree (comparison sorting algorithm)
body: <p>What is the <strong>shortest possible depth</strong> of a leaf in decision tree refering to <a href="https://en.wikipedia.org/wiki/Comparison_sort" rel="noreferrer">comparison sorting algorithm</a> ?</p>
  
  <p>Does it change depending on the alogrithm?</p>