The project was given as a final test to see if I would be able to apply the knowledge I have about programming as a whole into a language I had never used. This assignment required learning and making use of Scheme's naturally recursive nature to create a binary tree. The main challenge comes from trying to understand the unfamiliar syntax of the language, and less on the actual logic that comes with creating a binary tree.
-
Notifications
You must be signed in to change notification settings - Fork 0
DanielUAL/SchemeBinaryTree
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
This assignment required learning and making use of Scheme's naturally recursive nature to create a binary tree.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published