NotesFAQContact Us
Search Tips
ERIC Number: ED095924
Record Type: Non-Journal
Publication Date: 1973-Jan
Pages: 16
Abstractor: N/A
Reference Count: N/A
Two Upper Bounds for the Weighted Path Length of Binary Trees. Report No. UIUCDCS-R-73-565.
Pradels, Jean Louis
Rooted binary trees with weighted nodes are structures encountered in many areas, such as coding theory, searching and sorting, information storage and retrieval. The path length is a meaningful quantity which gives indications about the expected time of a search or the length of a code, for example. In this paper, two sharp bounds for the total path length of general weighted node trees are derived. (Author)
Publication Type: Reports - Research
Education Level: N/A
Audience: N/A
Language: N/A
Sponsor: Ministry of Foreign Affairs, Paris (France).
Authoring Institution: Illinois Univ., Urbana. Dept. of Computer Science.