roni zongor & co       let's talk
home web software science about blog contact

Interval Merging Binary Tree Part I - Motivation

by István Finta | sept 07, 2023 Interval Merging Binary Tree is a data structure intended to act as an efficient, fast in-memory filter next to low memory footprint. Under certain circumstances it can provide O(1) time complexity, just like hash based data structures.

Interval Merging Binary Tree is a data structure intended to act as an efficient, fast in-memory filter next to low memory footprint. Under certain circumstances it can provide O(1) time complexity, just like hash based data structures.


/ CONTACT

Feel free to contact us if you need unique and smart solution for your visual communication. /

Fill out the contact form or send an email directly. /
info(@)ronizongor.com

Feel free to contact us if you need unique and smart solution for your visual communication. /
Fill out the contact form or send an email directly to info(@)ronizongor.com

/ CONTACT