English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Nearly Optimal Binary Search Trees

Mehlhorn, K. (1975). Nearly Optimal Binary Search Trees. Acta Informatica, 5, 287-295.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFD5-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFD6-F
Genre: Journal Article

Files

show Files
hide Files
:
Mehlhorn_a_1975_f.pdf (Any fulltext), 330KB
 
File Permalink:
-
Name:
Mehlhorn_a_1975_f.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: Summary  We discuss two simple strategies for constructing binary search trees: Place the most frequently occurring name at the root of the tree, then proceed similary on the subtrees and choose the root so as to equalize the total weight of the left and right subtrees as much as possible, then proceed similarly on the subtres. While the former rule may yield extremely inefficient search trees, the latter rule always produces nearly optimal trees.

Details

show
hide
Language(s): eng - English
 Dates: 2006-11-301975
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344677
Other: Local-ID: C1256428004B93B8-546F7E6343E5772DC12571C3002DEA6B-mehlhorn75f
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Acta Informatica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 5 Sequence Number: - Start / End Page: 287 - 295 Identifier: -