Write down pre-order and post-order versions of the following in-order traversal of a Scheme binary tree.

(define (tree->list-l tree) (if (null? tree) (append (tree->list-1 (left-branch tree)) (cons (entry tree)