{"id":20772865,"url":"https://github.com/rcardin/btrees","last_synced_at":"2026-05-28T07:31:37.080Z","repository":{"id":82060523,"uuid":"163302836","full_name":"rcardin/btrees","owner":"rcardin","description":"A simple implementation of Binary Search Trees using Haskell (just for fun).","archived":false,"fork":false,"pushed_at":"2018-12-31T13:21:57.000Z","size":6,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-26T19:37:16.106Z","etag":null,"topics":["binary-search-tree","haskell","haskell-learning"],"latest_commit_sha":null,"homepage":"","language":"Haskell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-3-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rcardin.png","metadata":{"files":{"readme":"README.md","changelog":"ChangeLog.md","contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-12-27T14:21:51.000Z","updated_at":"2020-12-15T15:04:15.000Z","dependencies_parsed_at":null,"dependency_job_id":"e685d8b2-591c-493c-8f50-ec2ae7a177c7","html_url":"https://github.com/rcardin/btrees","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rcardin/btrees","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rcardin%2Fbtrees","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rcardin%2Fbtrees/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rcardin%2Fbtrees/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rcardin%2Fbtrees/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rcardin","download_url":"https://codeload.github.com/rcardin/btrees/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rcardin%2Fbtrees/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33599465,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-05-28T02:00:06.440Z","response_time":99,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["binary-search-tree","haskell","haskell-learning"],"created_at":"2024-11-17T12:23:18.072Z","updated_at":"2026-05-28T07:31:37.052Z","avatar_url":"https://github.com/rcardin.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Binary Search Trees in Haskell\n\nA simple and stupid implementation of Binary Search Trees in Haskell. The code refers the examples in the book [Learn You a Haskell for Great Good!](http://learnyouahaskell.com).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frcardin%2Fbtrees","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frcardin%2Fbtrees","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frcardin%2Fbtrees/lists"}