Linear-time construction of treaps and Cartesian trees

DOI10.1016/0020-0190(94)00150-2zbMath0815.68047OpenAlexW2010509073MaRDI QIDQ1339378

Mark Allen Weiss

Publication date: 1 December 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00150-2

zbMATH Keywords

search treeCartesian treeheap-ordered dequetreap

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (1)

A note on construction of treaps and Cartesian trees

Cites Work

• Solution of a Divide-and-Conquer Maximin Recurrence
• Priority Search Trees
• Self-adjusting binary search trees
• A unifying look at data structures
• New Results on Dynamic Planar Point Location
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear-time construction of treaps and Cartesian trees