 Transpose - Maple Help

Iterator[Trees]

 Transpose
 compute the transpose of a tree Calling Sequence Transpose(tree, format=fmt) Parameters

 tree - seq(rtable) fmt - (optional) A,C,D,E,LR,P,S,Z Options

 • format = A,C,D,E,LR,P,S,Z
 Specifies the format of the tree. The default is LR. See Iterator[Trees] for a description of the formats. Description

 • The Transpose command computes the transpose of a tree. The transpose of a binary tree is formed by interchanging left and right links. The transpose of a tree of a given format is computed by converting it to a binary tree, interchanging, then converting back to the specified format.
 • The tree parameter is the tree. Examples

 > $\mathrm{with}\left(\mathrm{Iterator}:-\mathrm{Trees}\right):$

Generate a random tree with four internal nodes in LR format.

 > $L,R≔\mathrm{Random}\left(4,\mathrm{format}=\mathrm{LR}\right)$
 ${L}{,}{R}{≔}\left[\begin{array}{cccc}{2}& {3}& {0}& {0}\end{array}\right]{,}\left[\begin{array}{cccc}{4}& {0}& {0}& {0}\end{array}\right]$ (1)

Compute its transpose.

 > $\mathrm{Transpose}\left(L,R\right)$
 $\left[\begin{array}{cccc}{2}& {0}& {0}& {0}\end{array}\right]{,}\left[\begin{array}{cccc}{3}& {0}& {4}& {0}\end{array}\right]$ (2) References

 Knuth, Donald Ervin. The Art of Computer Programming, volume 4, fascicle 4; generating all trees, sec. 7.2.1.6, generating all trees, exercise 12, p. 33. Compatibility

 • The Iterator[Trees][Transpose] command was introduced in Maple 2016.