To me a binary tree can be defined like this.
;; A BinaryTree is either
;; - false OR
;; - (BinaryTree Anything BinaryTree BinaryTree)
I built a data structure which looked like a tree, but I think it's
different. What should this be called? I called it a blob since I didn't
know what it was.
;; A Blob is either
;; - false OR
;; - (Blob Stuff Stuff)
;; A Stuff is either
;; - false OR
;; - (Stuff Anything Blob Blob)
It looks like a BinaryTree. Inside a blob there are two objects of type
Stuff each of which points to two other Blobs. (Much like a binary tree
with left and right branches pointing each to two other binary trees.)
(*) Examples of blobs
1. FALSE
2. (BLOB (STUFF 'left FALSE) (STUFF 'right FALSE))
3. (BLOB
(STUFF 'left (BLOB (STUFF 'x FALSE) (STUFF 'y FALSE)))
(STUFF 'rigt (BLOB (STUFF 'a FALSE) (STUFF 'b FALSE))))
Thank you!
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
