On succinct representations of binary trees (Q2363992)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On succinct representations of binary trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On succinct representations of binary trees |
scientific article |
Statements
On succinct representations of binary trees (English)
0 references
17 July 2017
0 references
succinct data structure
0 references
binary tree
0 references
ordinal tree
0 references
Zaks' sequence
0 references
Cartesian tree
0 references
tree traversal
0 references
0.9012718796730042
0 references
0.848404049873352
0 references
0.8470731973648071
0 references
0.8461853861808777
0 references
0.8456116318702698
0 references
