| http://www.w3.org/ns/prov#value | - To build such a tree, if the value to be stored is an operator, it must be a parent node - try adding to left of the current node and, if left child is already occupied, then try right, if occupied then move to current node's parent and keep testing for right, if no move to parent or, if not occupied, add to right, then expect that new parent node take two children [as long as the operator is a bi
|
