Then the hidden state h j of a node j can be computed by combining the hidden state h P(j) of its parent node P(j) and its own input vector x j .
the transition equations of node j can be formulated as a standard GRU: Through the top-down recursion, the learned representations are eventually embedded into the hidden vector of all the leaf nodes.