# 8 1 1 What is the smallest possible depth of a leaf in a decision t

Content type
User Generated
Rating
Showing Page:
1/1
8. 1-1 What is the smallest possible depth of a leaf in a
decision tree for a comparison sort?
Solution
this happens when we work for best case: in this we will
have to compare atleast n-1 times to come to conclusion.
thus smallest possible depth is n-1.

Unformatted Attachment Preview
8. 1-1 What is the smallest possible depth of a leaf in a decision tree for a comparison sort? Solution this happens when we work for best case: in this we will have to compare atleast n-1 times to come to conclusion. thus smallest possible depth is n-1. Name: Description: ...
Purchase document to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

### Review

Anonymous
I was having a hard time with this subject, and this was a great help.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4