Question: Let T be a (possibly improper) binary tree with n nodes, and let D be the sum of the depths of all the external nodes
Let T be a (possibly improper) 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.42 Rating (165 Votes )
There are 3 Steps involved in it
Let T be a binary tree with n nodes The sum of the depths of all the ... View full answer
Get step-by-step solutions from verified subject matter experts
