Two operations can be defined which in combination make these structures (called, naturally enough, “prototype trees”) suitable for use as components: instantiation (see below) and serialization (that is, conversion into a form suitable for separate storage). Together, these enable the assembly of applications from stored elements.
Serialization is implemented by assigning numeric codes to the nodes of the object graph to be serialized, and then building a JSON-compatible description of the graph, including prototype chains. Here is some code.
(A technicality: the restriction to trees in terms of object-property-value edges is, in the implementation, relaxed by allowing a third sort of edge: the “cross-tree link”. The details are available in the document cited just above.)
The implementation of prototype trees is open source, under the MIT license. Here is the GitHub repository. Also included in the GitHub repo is code which realizes visual items via SVG. Here are some code samples.