Shuffle Tree: A Randomized Self-Adjusting Binary Search Tree

2023 · doi:10.21203/rs.3.rs-3136752/v1
preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

AbstractWe present algorithms for a new self-adjusting binary search tree, which we call ashuffle tree. The tree is easy to implement and does not require parent pointers orbalancing information to be stored in tree nodes. A maximum of one rotation isapplied randomly during each traversal, which keeps the cost of balancingactivity low.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-20T11:00:21.680559+00:00
License: CC-BY-4.0