I searched for the name of the procedure, which applies the tree structure of the procedures to the tree structure of the data, giving a tree structure of the results - all three trees have the same structure.
Such a procedure may be signed:
(map-tree data functree)
Its return value will be the result of elementary application of functree elements on the corresponding data elements.
Examples (assuming the procedure is called map-tree):
Example 1:
(define * 2 (lambda (x) (* 2 x)))
; and similar definitions for * 3 and * 5
(map-tree '(100 (10 1))' (* 2 (* 3 * 5)))
will give a result
(200 (30 5))
Example 2:
(map-tree '(((aa. ab) (bb. bc)) (cc. (cd. ce)))
'((car cdr) cadr))gives the result
((aa bc) cd)
SLIB, .
?
, ?