2–3 heap
In computer science, a 2–3 heap is a data structure that implements a priority queue. It is a variation on the heap, designed by Tadao Takaoka in 1999.
In computer science, a 2–3 heap is a data structure that implements a priority queue. It is a variation on the heap, designed by Tadao Takaoka in 1999.
In computer science, a 2–3 heap is a data structure that implements a priority queue. It is a variation on the heap, designed by Tadao Takaoka in 1999.
Source: Wikipedia "2–3 heap" · CC BY-SA 4.0
Share this article: X · Bluesky