Exercise XSLT/BinomTrees

Topic: Computing with XSLT; Recursive named templates

A binomial tree B_k is an ordered tree defined as follows: B₀ is a single node, and B_k+1 consists of a root node that has binomial trees B_k, ..., B₀ as its immediate subtrees (in order from left to right). (Binomial trees are used as an efficient implementation of priority queues.) Write XSLT template rules that create an XML representation of binomial tree B_k for a given value of k.

Example (to compute B₃):

      java -jar saxon.jar binomialTree.xslt binomialTree.xslt k=3
      <B3>
        <B2>
          <B1>
            <B0/>
          </B1>
          <B0/>
        </B2>
        <B1>
          <B0/>
        </B1>
        <B0/>
      </B3>

Use file binomialTree.xslt as a starting point. (It also shows how to generate elements with a computed type name; see Section 7.1.2 of the XSLT Recommendation.)