1.  If we had only
RTAG fields (not
LLINK) in a level order sequential representation like (8), would it be possible to reconstruct the
LLINKs? (In other words, are the
LLINKs redundant in (8), as the
RLINKs are in (3)?)
2.  (Burks, Warren, and Wright, Math. Comp. 8 (1954), 53–57.) The trees (2) stored in preorder with degrees would be
[compare with (9), where postorder was used]. Design an algorithm analogous to Algorithm F to evaluate a locally defined function of the nodes by going from right to left in this ...