For Dr.Racket/Scheme programmers for some reason the code needs #lang eopl at the top I do not know why

Write a procedure path that takes an integer n and a binary search tree bst (page 10) that contains the integer n, and returns a list of lefts and rights showing how to nd the node containing n. If n is found at the root, it returns the empty list.

> (path 17 ' (14 (7 () (12 () ()))

(26 (20 (17 () ())

())

(31 () ()))))

(right left left)