TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

PG's Binary Search Trees in Clojure

38 pointsby nkhabout 15 years ago

2 comments

j_bakerabout 15 years ago
Dumb question time: what's the difference between PG's BST and any other BST?
评论 #1313495 未加载
评论 #1313464 未加载
Kototamaabout 15 years ago
You may also be interested by my implementation with / without various form of tail-recursion using recur or without: <a href="http://github.com/kototama/ansicommonlisp-book-clojure/blob/master/ch04/bst.clj" rel="nofollow">http://github.com/kototama/ansicommonlisp-book-clojure/blob/...</a>