Information | |
---|---|
has gloss | eng: In computer science, a 2-3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2-3 tree. |
lexicalization | eng: 2-3 heap |
instance of | e/Heap data structure |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint