walkccc / CLRS

📚 Solutions to Introduction to Algorithms Third Edition
https://walkccc.me/CLRS
MIT License
4.63k stars 1.26k forks source link

Update 4.4.md #453

Closed aschroede closed 2 years ago

aschroede commented 2 years ago

Corrected the number of levels in the tree from n to n+1. Also considered the costs of each of the leaf nodes in the analysis. Corrected the inductive proof as the previous answer was incorrect.

walkccc commented 2 years ago

Nice catch thanks!