problemset9 solutions

# Then the total wire area of not counting the longest

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: he longest root-to-leaf path in � � . Let �� be the length of the longest root-to-leaf path in � � . Let � � � �� 3 �� � � �� the most unbalanced case, where �  � , we have a rectangle that is   . This is “nearly square” because  � , and hence  � , so the longer dimension is at most times the shorter one. 2 ties are broken arbitrarily 3 The longest root-to-leaf path has to pass through the roots of one of the subtrees, so it must include the root-to-leaf path of one of the subtrees 1 in � � Handout 19: Solution Set 9 2 �� and �� be the total wire area of each of the subtrees � � and ��, respectively, not counting the longest root-to-leaf paths. Then the total wire area � of � not counting the longest root-to-leaf path is given by � � � � � �� � �� . Since �� and �� have ��� leaves, �� � ������, and �� � ������. Thus, � � �������...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online