All Questions
5 questions
1
vote
1
answer
3k
views
Binary search tree insertion in Racket
I am learning Racket and implemented a BST insert function (insert tree n) where the format for a BST node is ...
- 13
4
votes
1
answer
180
views
Implementing a tree parsing function
I've solved an assignment a week ago, which is my first assignment using Lisp.
Tasks:
Task 1:
a. Given a tree as recursive lists, print the tree in breadth first order.
b. Given a tree like in ...
10
votes
1
answer
1k
views
Functional tree iteration in Common Lisp
I'm adding some functionality to an existing library of data structures in Common Lisp, with a view to asking the original author if I can take over maintenance and development of it. While the ...
- 305
2
votes
0
answers
1k
views
Union-set intersection-set for a binary-tree implementation of sets
From SICP:
Exercise 2.65
Use the results of
exercises 2.63 and 2.64 to give (n)
implementations of union-set and
intersection-set for sets implemented
as (balanced) binary trees.41
I ...
- 2,283
4
votes
1
answer
1k
views
Abstract tree-map function
Exercise 2.31. Abstract your answer
to exercise 2.30 to produce a
procedure tree-map with the property
that square-tree could be defined as
...
- 2,283