Data tree: partial indexing

When writing into the data tree, we eagerly create TreeNodes for the entire subtree. This is not necessary until there is a write touching the insides of the subtree.

Implement partial indexing, where we do create TreeNodes only when we need them for writes. In read perspective, we do not need to create TreeNodes at all, as the top of the subtree is sufficient to represent its children from dependency tracking.