13 ms·

PG's Binary Search Trees in Clojure

• j_baker 16y ago
  Dumb question time: what's the difference between PG's BST and any other BST?
  • fogus 16y ago
    Up-votes?
  • zachbeane 16y ago
    Paul Graham's was wrong in his book (see http://www.paulgraham.com/howbroken.html http://www.paulgraham.com/howbroken.html) but fixed in his later code listing (see http://lib.store.yahoo.net/lib/paulgraham/acl2.lisp http://lib.store.yahoo.net/lib/paulgraham/acl2.lisp). The Clojure code looks like the broken version to me.
    • pg 16y ago
      I think you're mistaken. The Clojure version seems to be derived from the Arc version at http://ycombinator.com/arc/bst.arc http://ycombinator.com/arc/bst.arc, which is turn derived from the corrected Common Lisp version.
• deleted 16y ago
  [deleted]
• Kototama 16y ago
  You may also be interested by my implementation with / without various form of tail-recursion using recur or without: http://github.com/kototama/ansicommonlisp-book-clojure/blob/master/ch04/bst.clj http://github.com/kototama/ansicommonlisp-book-clojure/blob/...