Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00170979n
Noun Concept
Categories: Trees (data structures), Associative arrays
EN
fusion tree
EN
In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers on a finite universe, where each of the input integers has size less than 2w and is non-negative. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers on a finite universe, where each of the input integers has size less than 2w and is non-negative. Wikipedia
IS A
B-tree
HAS KIND
AF-heap
STUDIED BY
graph theory
Wikipedia
EN
fusion tree
Wikidata
EN
fusion tree

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License