WORST_CASE(?,O(n^1))

Solution:
---------

  Cons :: [A(0) x A(12)] -(12)-> A(12)
  Cons :: [A(0) x A(0)] -(0)-> A(0)
  Leaf :: [A(11)] -(11)-> A(11)
  Nil :: [] -(0)-> A(12)
  Nil :: [] -(0)-> A(14)
  Nil :: [] -(0)-> A(6)
  Node :: [A(11) x A(11)] -(11)-> A(11)
  dfsAcc#3 :: [A(11) x A(12)] -(2)-> A(12)
  main :: [A(14)] -(15)-> A(0)
  revApp#2 :: [A(12) x A(0)] -(8)-> A(0)


Cost Free Signatures:
---------------------

  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Leaf :: [A_cf(0)] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  Node :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  dfsAcc#3 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  revApp#2 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  Cons_A :: [A(0) x A(1)] -(1)-> A(1)
  Leaf_A :: [A(1)] -(1)-> A(1)
  Nil_A :: [] -(0)-> A(1)
  Node_A :: [A(1) x A(1)] -(1)-> A(1)