Optimal Shortcuts for Balanced Search Trees
| dc.contributor.author | Hartline, Jeff | en_US |
| dc.date.accessioned | 2007-04-04T20:21:30Z | |
| dc.date.available | 2007-04-04T20:21:30Z | |
| dc.date.issued | 2006-02-23 | en_US |
| dc.description.abstract | We present an alternative to tree rebalancing for improving the expected search cost in weighted binary search trees. This alternative is based on the insertion of shortcut links between nodes in the search tree. We propose several shortcut models and give polynomial time algorithms to find the best shortcuts for two of these models. | en_US |
| dc.format.extent | 243820 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2006-2017 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5717 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Optimal Shortcuts for Balanced Search Trees | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1