If you want balanced trees, have a look at what Rust's standard library does with BTreeMap.

And with a little work you can even use them to map ranges of keys to values in a way that's reminiscent of interval trees — e.g. https://crates.io/crates/rangemap. (Disclosure: that's my crate.)

	▲	eru a day ago \| parent \| next [-]
		Nice! I was only suggesting considering BTrees because they also play nice with caches, instead of the more conventional binary tree balancing mechanisms.
	▲	airstrike a day ago \| parent \| prev [-]
		I love that crate! Kudos