Re: [racket-users] BST fold function and finding a node

2017-09-10 Thread Matthias Felleisen
> On Sep 10, 2017, at 9:10 AM, Fernando Basso > wrote: > > Thanks for the help. I found it amazingly well worded, giving me proper > insights to reach a solution without giving the solution proper, which I > happen to believe to be one of the most effective ways to help one learn > anything.

Re: [racket-users] BST fold function and finding a node

2017-09-10 Thread Fernando Basso
Thanks for the help. I found it amazingly well worded, giving me proper insights to reach a solution without giving the solution proper, which I happen to believe to be one of the most effective ways to help one learn anything. Much appreciated. And indeed, I reworked the code using the four st

Re: [racket-users] BST fold function and finding a node

2017-09-08 Thread Matthias Felleisen
You may wish to read Chapter 16 in HtDP/2e: http://www.ccs.neu.edu/home/matthias/HtDP2e/part_three.html#%28part._ch~3a3use%29 It teaches how to re-use an existing abstraction, which is what you are having trouble with. To help you along, I have changed your code in a few places: (1) I e

[racket-users] BST fold function and finding a node

2017-09-08 Thread Fernando Basso
I am doing an exercise from EDX course based on H2DP book and am having trouble implementing a `find` function using the abstract function fold-elt. The function should find the element and return its data. - #lang htdp/isl (define-struct elt (name data subs)) ;; Element is (make-elt String