Tree.to_list.go: def of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/tree.bend as Tree
Lines 29-35 of bend-lawful-stdlib@0.1.0.0/src/tree.bend: https://jend.leeeet.dev/read.txt?path=bend-lawful-stdlib@0.1.0.0/src/tree.bend&start_line=29&end_line=35

import Base

# the leaves, left to right, in front of acc
def to_list.go(-A: Data, t: Tree<A>, acc: List<&2, A>) -> List<&2, A>:
  match t:
    case Tip{x}:
      x <> acc
    case Fork{l, r}:
      to_list.go(A, l, to_list.go(A, r, acc))

Uses (2):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/tree.bend&name=Tree