0 votes 0 votes What is the smallest possible depth of a leaf in a decision tree for a comparison sort? Algorithms cormen algorithms sorting descriptive + – akash.dinkar12 asked Jun 28, 2019 akash.dinkar12 343 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes think solution simply as a connected tree having n-1 edges Asim Siddiqui 4 answered Jul 15, 2019 Asim Siddiqui 4 comment Share Follow See all 0 reply Please log in or register to add a comment.