{"id":25171718,"url":"https://github.com/basemax/completetreecheckergo","last_synced_at":"2025-04-03T21:24:19.211Z","repository":{"id":151535267,"uuid":"581809067","full_name":"BaseMax/CompleteTreeCheckerGo","owner":"BaseMax","description":"This is a simple Go program that checks if a given tree is complete or not. A tree is complete if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.","archived":false,"fork":false,"pushed_at":"2022-12-24T12:36:43.000Z","size":19,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-28T17:08:04.783Z","etag":null,"topics":["complete-tree","data-structure","datastructure","ds","go","golang","tree","tree-complete","tree-search","tree-structure","tree-traversal","tree-traversal-algorithm","tree-traversal-algorithms"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BaseMax.png","metadata":{},"created_at":"2022-12-24T12:19:05.000Z","updated_at":"2022-12-31T18:29:41.000Z","dependencies_parsed_at":"2023-07-12T03:01:29.513Z","dependency_job_id":null,"html_url":"https://github.com/BaseMax/CompleteTreeCheckerGo","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCompleteTreeCheckerGo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCompleteTreeCheckerGo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCompleteTreeCheckerGo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCompleteTreeCheckerGo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/CompleteTreeCheckerGo/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247080330,"owners_count":20880245,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["complete-tree","data-structure","datastructure","ds","go","golang","tree","tree-complete","tree-search","tree-structure","tree-traversal","tree-traversal-algorithm","tree-traversal-algorithms"],"created_at":"2025-02-09T09:21:43.217Z","updated_at":"2025-04-03T21:24:19.205Z","avatar_url":"https://github.com/BaseMax.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fcompletetreecheckergo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2Fcompletetreecheckergo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fcompletetreecheckergo/lists"}