Question: Let T be a (not necessarily proper) binary tree with n nodes, and let D be the sum of the depths of all the external
Let T be a (not necessarily proper) binary tree with n nodes, and let D be the sum of the depths of all the external nodes of T. Show that if T has the minimum number of external nodes possible, then D is O(n) and if T has the maximum number of external nodes possible, then D is O(nlogn).
Step by Step Solution
3.64 Rating (158 Votes )
There are 3 Steps involved in it
If T has the minimum number of external nodes possible then the s... View full answer
Get step-by-step solutions from verified subject matter experts
