Hello,
I'm new to this newsgroup and have a maybe silly question, but =
I didn't found it in the FAQ.
I want to implement a tree-based search. I now use a simple =
binary tree with tail-recursion, but I think of doing my search
with an AVL-tree. =
I have the algorithm for AVL trees in a book by Niklas Wirth, =
written down in Modula-2. My question is now, can this be =
adopted to LISP, how is ist done, has somebody already done it?
My problem is, that Wirth implicitly uses the procedure calling
stack to store the information to rebalance the tree and he =
uses extensively variable parameters on this stack!
I hope, someone can help.
Ciao,
Stephan Gro=DF
······@informatik.uni-hamburg.de