This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (a) A simple path in T is one where all the nodes are distinct and its length is the number of edges on it. The height , h , of T is the length of a longest simple path from the root to a descendant external node (leaf). Let s be the length of a shortest simple path from the root to a descendant external node. Prove that h/s ≤ 2. (b) Let n ′ be the number of internal nodes in T that are at distance less than s from the root (i.e., at most s1 edges away from the root). Derive an expression for n ′ . (c) Use the results in parts (a) and (b) to obtain the desired upper bound of 2log( n + 1) for h . 5. (14 points) Ex. 13.24, p. 314. 6. (16 points) Problem 132, p. 332333....
View
Full
Document
This note was uploaded on 11/20/2010 for the course CSCI 5421 taught by Professor Sturtivant,c during the Fall '08 term at Minnesota.
 Fall '08
 Sturtivant,C
 Algorithms, Data Structures

Click to edit the document details