English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A best possible bound for the weighted path length of binary search trees

Mehlhorn, K. (1977). A best possible bound for the weighted path length of binary search trees. SIAM Journal on Computing, 6, 235-239.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFA7-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFA8-8
Genre: Journal Article

Files

show Files
hide Files
:
Mehlhorn_a_1977_a.pdf (Any fulltext), 363KB
 
File Permalink:
-
Name:
Mehlhorn_a_1977_a.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: The weighted path length of optimum binary search trees is bounded above by $\sum \beta_i + 2\sum \alpha_j + H$ where $H$ is the entropy of the frequency distribution, $\sum \beta _i $ is the total weight of the internal nodes, and $\sum \alpha_j$ is the total weight of the leaves. This bound is best possible. A linear time algorithm for constructing nearly optimal trees is described.

Details

show
hide
Language(s): eng - English
 Dates: 2008-03-061977
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344560
Other: Local-ID: C1256428004B93B8-1AA761D05D1DC144C1257141004868DC-Mehlhorn77a
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: SIAM Journal on Computing
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 6 Sequence Number: - Start / End Page: 235 - 239 Identifier: -