A node in this tree structure holds entries.
Each entry is a tuple consisting of an object and its associated properties.
It’s essential to note that the properties vary between a LeafNode and an InternalNode.
Both LeafNodes and InternalNodes are implemented as a map.
In this map, the key is an object, and the values correspond to its properties.
In essence, an entry can be visualized as a tuple of the form (object, properties).