Re: [racket-users] Question on test failures sorting a BTS

2020-04-27 Thread Jon Zeppieri
In addition to what Jens said, you should probably give a definition of a BST at the top, and give some thought to the question of why a BST is not simply the same thing as a node. - Jon On Sun, Apr 26, 2020 at 10:36 PM Kristina Marie wrote: > > Hello, > I am trying to use HtDF to create a funct

Re: [racket-users] Question on test failures sorting a BTS

2020-04-27 Thread Jens Axel Søgaard
Den man. 27. apr. 2020 kl. 04.36 skrev Kristina Marie : > Hello, > I am trying to use HtDF to create a function to sort a Binary Search Tree. > I am in an intro class so this may be a simple question. I did the > following: > > ;define-struct a node > (define-struct node (left value right)) > ...

[racket-users] Question on test failures sorting a BTS

2020-04-26 Thread Kristina Marie
Hello, I am trying to use HtDF to create a function to sort a Binary Search Tree. I am in an intro class so this may be a simple question. I did the following: ;define-struct a node (define-struct node (left value right)) ;BTS leafs (define a-node(make-node null "A" null)) (define b-node (make-n