WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Cons" :: ["A"(0) x "A"(2)] -(2)-> "A"(2)
  "Leaf" :: ["A"(12)] -(12)-> "A"(12)
  "Nil" :: [] -(0)-> "A"(1)
  "Nil" :: [] -(0)-> "A"(10)
  "Nil" :: [] -(0)-> "A"(14)
  "Node" :: ["A"(12) x "A"(12)] -(12)-> "A"(12)
  "dfsAcc#3" :: ["A"(12) x "A"(2)] -(0)-> "A"(2)
  "main" :: ["A"(14)] -(16)-> "A"(0)
  "revApp#2" :: ["A"(1) x "A"(0)] -(15)-> "A"(0)


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




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)