This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: minimum spanning tree. Give either a proof or a counterexample. 9.5 Let us dene the height of a rooted tree to the length of the path from the root to the deepest node in the tree. A (rooted) tree with only one node (the root) has a height of zero. A balanced binary tree is commonly dened as a binary tree in which the height of the two subtrees of every node never dier by more than one. What is the maximum (and the minimum) number of nodes in a balanced binary tree of height h 0? 2...
View Full Document
This note was uploaded on 02/02/2012 for the course CSE 21 taught by Professor Graham during the Fall '07 term at UCSD.
- Fall '07