The Gateway to Computer Science Excellence
0 votes
25 views
What is the smallest possible depth of a leaf in a decision tree for a comparison sort?
in Algorithms by Boss (42.5k points) | 25 views

1 Answer

0 votes

think solution simply as a connected tree having n-1 edges

by Active (1.6k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,390 answers
198,589 comments
105,443 users