I'm not sure how many people on here know Scheme, but I was wondering if anyone could help me figure out how to convert a binary search tree (with an integer key, a left node and a right node) into a list of integers. Additionally I can't use append and my solution needs to be in O(n). Thanks!

Question

anonymous · Answer

Thanks to anyone who took a look. I figured out a solution on my own though

shadowfiend · Answer

Ah sweet heh. Was going to ask to see your BST's structure first :)

anonymous · Answer

The structure was pretty simple just,
(define-struct BST (key left right) #:transparent)

shadowfiend · Answer

Got it. Cool stuff! :)